We investigate the structure of \(\omega \)-limit (resp. \(\alpha \)-limit) sets for a monotone map f on regular curve X. show that any \(x\in X\) negative orbit \((x_{n})_{n\ge 0}\) x), set _{f}(x)\) _{f}((x_{n})_{n\ge 0})\)) is minimal set. This also holds whenever x not periodic point. These results extend those Naghmouchi [24] established homeomorphism and Abdelli [1], local dendrite. Furth...

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

An ω-limit set of a continuous self-mapping compact metric space X is said to be totally periodic if all its points are periodic. In [3] Askri and Naghmouchi proved that f one-to-one self mapping regular curve, then every finite. This also holds whenever monotone map local dendrite by Abdelli in [1]. this paper we generalize these results maps on curves. On the other hand, give some remarks rel...

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

In this article we present an efficient algorithm to compute rotation intervals of circle maps degree one. It is based on the computation number a monotone map one with constant section. The main strength that it computes \emph{exactly} interval natural subclass continuous non-invertible maps. We also compare our other existing ones by plotting Devil's Staircase one-parameter family and Arnold ...

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 consider the weighted monotone and antimonotone satisfiability problems on normalized circuits of depth at most t ≥ 2, abbreviated wsat[t] and wsat−[t], respectively. These problems model the weighted satisfiability of monotone and antimonotone propositional formulas (including weighted monotone/antimonotone cnf-sat) in a natural way, and serve as the canonical problems in the definition of ...

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