We investigate the initial value problem for a class of fractional evolution equations in a Banach space. Under some monotone conditions and noncompactness measure conditions of the nonlinearity, the well-known monotone iterative technique is then extended for fractional evolution equations which provides computable monotone sequences that converge to the extremal solutions in a sector generate...

Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...

This section presents a setup that arises frequently in adverse selection settings and provides conditions on the primitives such that the properties that de…ne a game with monotone selection are satis…ed. The following de…nitions and results (in addition to those in the print appendix) are used: A correspondence : T ! X is increasing in the strong set order if when t > t0, then for each x 2 (t...

This paper deals with entire solutions for a general nonlocal dispersal monostable equation with spatiotemporal delay, i.e., solutions that are defined in the whole space and for all time t ∈ R. We first derive a particular model for a single species and show how such systems arise from population biology. Then we construct some new types of entire solutions other than traveling wave solutions ...

A path v1, v2, . . . , vm in a graph G is degree-monotone if deg(v1) ≤ deg(v2) ≤ · · · ≤ deg(vm) where deg(vi) is the degree of vi in G. Longest degree-monotone paths have been studied in several recent papers. Here we consider the Ramsey type problem for degree monotone paths. Denote by Mk(m) the minimum number M such that for all n ≥ M , in any k-edge coloring of Kn there is some 1 ≤ j ≤ k su...

The aim of this paper is to investigate hybrid algorithm for a common zero point of the sum of two monotone operators which is also a fixed point of a family of countable quasi-nonexpansive mappings. We point out two incorrect proof in paper (Hecai in Fixed Point Theory Appl 2013:11, 2013). Further, we modify and generalize the results of Hecai's paper, in which only a quasi-nonexpansive mappin...

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N ≥ 2) nonoverlapping components with the same size. Then, these components are combined together to form the parity-check matrix of a longer code, according to a given N×N Latin square....

We present a simple approach to study the one–dimensional pressureless Euler system via adhesion dynamics in the Wasserstein space P 2 (R) of probability measures with finite quadratic moments. Starting from a discrete system of a finite number of " sticky " particles, we obtain new explicit estimates of the solution in terms of the initial mass and momentum and we are able to construct an evol...

We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As main ingredient we introduce a new algorithm, named Similarity-First-Search (SFS), which extends Lexicographic BreadthFirst S...

It is of great interest to find the minimum effective dose (MED) in dose-response studies. A sequence of decreasing null hypotheses to find the MED is formulated under the assumption of nondecreasing dose response means. A step-up multiple test procedure that controls the familywise error rate (FWER) is constructed based on the maximum likelihood estimators for the monotone normal means. When t...