Ding, G., Monotone clutters, Discrete Mathematics 119 (1993) 67-77. A clutter is k-monotone, completely monotone or threshold if the corresponding Boolean function is k-monotone, completely monotone or threshold, respectively. A characterization of k-monotone clutters in terms ofexcluded minors is presented here. This result is used to derive a characterization of 2-monotone matroids and of 3-m...

‎In this paper‎, ‎we generalize the proximal point algorithm to complete CAT(0) spaces and show‎ ‎that the sequence generated by the proximal point algorithm‎ $w$-converges to a zero of the maximal‎ ‎monotone operator‎. ‎Also‎, ‎we prove that if $f‎: ‎Xrightarrow‎ ‎]-infty‎, +‎infty]$ is a proper‎, ‎convex and lower semicontinuous‎ ‎function on the complete CAT(0) space $X$‎, ‎then the proximal...

1. Overview This paper talks about that monotone circuit is P-Complete. Decision problem that include P-Complete is mapping that classify input with a similar property. Therefore equivalence relation of input value is important for computation. But monotone circuit cannot compute the equivalence relation of the value because monotone circuit can compute only monotone function. Therefore, I make...

We characterize the size of monotone span programs computing certain “structured” boolean functions by the Nullstellensatz degree of a related unsatisfiable Boolean formula. This yields the first exponential lower bounds for monotone span programs over arbitrary fields, the first exponential separations between monotone span programs over fields of different characteristic, and the first expone...

Let D be a nonempty convex subset of a Banach spaces E. Let F be a bifunction from D ×D to R, where R is the set of all real numbers. The equilibrium problem for F is to find x ∈ D such that F x, y ≥ 0 for all y ∈ D. The set of such solutions is denoted by EP F . The set D is called proximal if for each x ∈ E, there exists an element y ∈ D such that ‖x − y‖ d x,D , where d x,D inf{‖x − z‖ : z ∈...

In this paper, we establish some sufficient conditions for the existence of a solution equilibrium problem. The problem is understood in general form: find $ \overline{x}\in E such that$ \begin{equation*} \Phi(\overline{x},y) \vartriangleleft (-D\backslash\{0\})^c \text{ all }y \in E; \end{equation*} $and its variants, where Boolean-valued bifunction and \Phi multivalued mapping with values vec...

This paper deals with monotone relaxation iterates for solving nonlinear monotone difference schemes of elliptic type. The monotone ω-Jacobi and SUR (Successive Under-Relaxation) methods are constructed. The monotone methods solve only linear discrete systems at each iterative step and converge monotonically to the exact solution of the nonlinear monotone difference schemes. Convergent rates of...