Entanglement concurrence has been widely used for featuring entanglement in quantum experiments. As an monotone it is related to specific Tsallis entropy. Our goal this paper propose a new parameterized bipartite which named as $q$-concurrence inspired by general We derive analytical lower bound the of any state employing positive partial transposition criterion and realignment criterion, shows...

Intervals can be used in the representation of uncertainty. In this regard, we consider monotone interval-valued set functions and the Choquet integral. This paper investigates characterizations of monotone interval-valued set functions and provides applications of the Choquet integral with respect to monotone interval-valued set functions, on the space of measurable functions with the Hausdorf...

We prove strong convergence theorems for finding a common element of the zero point set of a maximal monotone operator and the fixed point set of a hemirelatively nonexpansive mapping in a Banach space by using monotone hybrid iteration method. By using these results, we obtain new convergence results for resolvents of maximal monotone operators and hemirelatively nonexpansive mappings in a Ban...

In one of their papers, F. Gécseg and B. Imreh gave a characterization for monotone string languages by regular expressions. It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages. In this paper a similar characterization is given for monotone DR-languages.

We prove necessary and sufficient conditions for locally Lipschitz Löwner operators to be monotone, strictly monotone and strongly monotone. Utilizing our characterization of the strict monotonicity of Löwner operators, we generalize Mangasarian class of Nonlinear Complementarity Problem (NCP)-functions to the setting of symmetric cone complementarity problem. This affirmatively answers a quest...

A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with n vertices on an O(n) × O(n) grid whose angles are close to the best possible angular resolution. Our drawings are convex, that is, if every edge to a leaf is substituted by a ray, the (un...

r down tò 2 , it is a weakly monotone increasing function. But in a monotone function, a value can only appear once (or in one continuous range). Since the function is divided into two weakly monotone regions, a xed value can appear at most twice (or in two continuous ranges). This suuces to show that there can be at most two intersections between (I r) and O r , one in each weakly monotone reg...

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Therefore, k-monotone functions are natural generalizations of the classical monotone functions, which are the 1-monotone functions. Motivated by the recent interest in k-monotone functions in the context of circuit complexity and learning theory,...

In this paper, we give two explicit examples of unbounded linear maximal monotone operators. The first unbounded linear maximal monotone operator S on l is skew. We show its domain is a proper subset of the domain of its adjoint S∗, and −S∗ is not maximal monotone. This gives a negative answer to a recent question posed by Svaiter. The second unbounded linear maximal monotone operator is the in...