It is well known that a continuous piecewise monotone interval map with positive topological entropy is semiconjugate to a map of a constant slope and the same entropy, and if it is additionally transitive then this semiconjugacy is actually a conjugacy. We generalize this result to piecewise continuous piecewise monotone interval maps, and as a consequence, get it also for piecewise monotone g...

We consider bifunctions F : C ×C → R where C is an arbitrary subset of a Banach space. We show that under weak assumptions, monotone bifunctions are locally bounded in the interior of their domain. As an immediate corollary, we obtain the corresponding property for monotone operators. Also, we show that in contrast to maximal monotone operators, monotone bifunctions (maximal or not maximal) can...

At diverging junctions in vehicular traffic networks, congestion on one outgoing link may impede traffic flow to other outgoing links. This phenomenon is referred to as the first-in-first-out (FIFO) property. Traffic network models that do not include the FIFO property result in monotone dynamics for which powerful analysis techniques exist. This note shows that a large class of FIFO network mo...

The subject is the applications of the use of quasi-entropy in finite dimensional spaces to many important quantities in quantum information. Operator monotone functions and relative modular operators are used. The origin is the relative entropy, and the f -divergence, monotone metrics, covariance and the χ2-divergence are the most important particular cases. The extension of monotone metrics t...

We consider piecewise monotone maps of the interval with zero entropy or no periodic points. First, we give a rigid model for these maps: the interval translations mappings, possibly with ips. It follows, e.g., that the complexity of a piecewise monotone map of the interval is at most polynomial if and only if this map has a nite number of periodic points up to monotone equivalence. Second, we ...

A curve γ in the plane is t-monotone if its interior has at most t− 1 vertical tangent points. A family of t-monotone curves F is simple if any two members intersect at most once. It is shown that if F is a simple family of n t-monotone curves with at least ǫn intersecting pairs (disjoint pairs), then there exists two subfamilies F1, F2 ⊂ F of size δn each, such that every curve in F1 intersect...

3. page 13, lines 12–13: Insert a phrase to stress that we consider only monotone LCP in this book, though the qualifier ”monotone” is often omitted. Replace the sentence preceding the formula (1.21) by The monotone LCP—the qualifier ”monotone” is implicit throughout this book—is the problem of finding vectors x and s in I R that satisfy the following conditions: 4. page 13, line −12: delete “o...

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...

We consider the problem of sharing pooled risks among n economic agents endowed with non-necessarily monotone monetary functionals. In this framework, results of characterization and existence of optimal solutions are easily obtained as extension from the convex risk measures setting. Moreover, the introduction of the best monotone approximation of non-monotone functionals allows us to compare ...

Multiplicative monotone span program is one of the important tools to realize secure multiparty computation. It is essential to construct multiplicative monotone span programs for secure multiparty computations. For any access structure, Cramer et al. gave a method to construct multiplicative monotone span programs, but its row size became double, and the column size also increased. In this pap...