We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation’s characterization of a hierarchy of pseudovarieties of finite lattices, progressively generalizing finite distributive lattices. This formal connection is mediated through monotone modal logic. Indeed, we adapt the correspondence algorithm ...

We show that the problem of guarding an x-monotone terrain from an altitude line and the problem of guarding a uni-monotone polygon are equivalent. We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide. Thus, uni-monotone polygons are perfect; this result also extends to monotone mount...

Monotone Lévy processes with additive increments are defined and studied. It is shown that these processes have natural Markov structure and their Markov transition semigroups are characterized using the monotone Lévy-Khintchine formula. 17 Monotone Lévy processes turn out to be related to classical Lévy processes via Attal's " remarkable transformation. " A monotone analogue of the family of e...

A metric space (X, d) is called c-monotone if there is a linear order < on X and c > 0 such that d(x, y) 6 c d(x, z) for all x < y < z in X. A brief account of investigation of monotone spaces including applications is presented. 1 Monotone and σ-Monotone Spaces. In [6] I investigated existence of sets in Euclidean spaces that have large Hausdorff dimension and yet host no continuous finite Bor...

We give a general complexity classi cation scheme for monotone computation, including monotone space-bounded and Turing machine models not previously considered. We propose monotone complexity classes includingmAC , mNC , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We de ne a simple notion of monotone reducibility and exhibit complete problems. This provides a framework for stating existing r...

We introduce and study a new system of nonlinear variational-like inclusions involving sG, η maximal monotone operators, strongly monotone operators, η-strongly monotone operators, relaxed monotone operators, cocoercive operators, λ, ξ -relaxed cocoercive operators, ζ, φ, g-relaxed cocoercive operators and relaxed Lipschitz operators in Hilbert spaces. By using the resolvent operator technique ...

Such a set G is said to be maximal monotone if it is maximal among monotone sets in the sense of set inclusion, and a mapping T is said to be maximal monotone if its graph G(T) is a maximal monotone set. For reflexive Banach spaces X and mappings T with D(T)~X, the basic result obtained independently by Browder [2] and Minty [20] states that if T is a monotone operator from D(T)=X to X* which i...

Abstract. We consider 3-monotone approximation by piecewise polynomials with prescribed knots. A general theorem is proved, which reduces the problem of 3-monotone uniform approximation of a 3-monotone function, to convex local L1 approximation of the derivative of the function. As the corollary we obtain Jackson-type estimates on the degree of 3-monotone approximation by piecewise polynomials ...

Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties of monotone span programs related to their size. Using the results of van Dijk (connecting codes and MSPs) and a construction for a dual monotone span program proposed by Cramer and Fehr we prove a non-trivial upper bound for ...

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...