In this paper, we introduce a new class of monotone operators − (H(·, ·), η)monotone operators, which generalize many existing monotone operators. The resolvent operator associated with an (H(·, ·), η)monotone operator is defined and its Lipschitz continuity is presented. As an application, we also consider a new generalized mixed variational inclusion involving (H(·, ·), η)-monotone operators ...

In this paper, we studied maximal monotonicity of type FPV for sum of two maximal monotone operators of type FPV and the obtained results improve and complete the corresponding results of this filed.

Abstract Monotone matrices are stochastic that satisfy the monotonicity conditions as introduced by Daley in 1968. Markov chains useful modeling phenomena several areas. Most previous work examines embedding problem for within entire set of transition matrices, and only a few studies focus on embeddability specific subset matrices. This article discrete-time monotone chain, i.e., existence matr...

The non-monotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f where f is a general Boolean function represented by CNF [4]. The DNF formula φ of f is easily obtained by De Morgan’s la...

We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these objects k-modems and study the minimum number of k-modems necessary to illuminate monotone and monotone orthogonal polygons. We show that every monotone polygon on n vertices can be...

We shall consider slightly more general problems. Namely, we shall investigate the existence of continuous: piecewise monotone, piecewise strictly monotone, and piecewise linear n-th roots of interval maps which have a continuous n-th root. Here by an n-th root of f we mean a map g such that f = g (g is the n-th iterate of g). A continuous map f : I → J , where I, J are closed intervals, is pie...

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or globally subanalytic sets. A monotone map is a multi-dimensional generalization of a usual univariate monotone continuous function on an open interval, while the closure of the graph of a monotone map is a generalization of a compact convex set. In a particular case of an identically con...

plexity method is not well suited to resolving this question. On the other hand, Razborov's approximation method also does not seem suitable, since so far it has been applied mainly to prove superpolynomial bounds for monotone circuits, while U C O N N , can be computed by polynomial-size monotone circuits. We show that any monotone circuit for computing graph connectivity must have a depth gre...

In [1] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals (e.g., real semialgebraic or subanalytic sets), and having connected intersections with all translated coordinate cones in Rn. In this paper we develop this theory further by defining monotone functions and maps, and studying their fundamental geometric properties. We prove several equ...