On a generalization of the Narayana triangle.
The paper is devoted to the problem of classification of extremal positive linear maps acting between 𝔅(𝒦) and 𝔅(ℋ) where 𝒦 and ℋ are Hilbert spaces. It is shown that every positive map with the property that rank ϕ(P) ≤ 1 for any one-dimensional projection P is a rank 1 preserver. This allows us to characterize all decomposable extremal maps as those which satisfy the above condition. Further, we prove that every extremal positive map which is 2-positive turns out to be automatically completely...
The partial ordering induced by the Loewner partial ordering on the convex cone comprising all matrices which multiplied by a given positive definite matrix become nonnegative definite is considered. Its relation to orderings which are induced by the Loewner partial ordering of the squares of matrices is presented. Some extensions of the latter orderings and their comparison to star orderings are given.
Let We call a complex number “semigroup free“ if the semigroup generated by and is free and “free” if the group generated by and is free. First families of semigroup free ’s were described by J. L. Brenner, A. Charnow (1978). In this paper we enlarge the set of known semigroup free ’s. To do it, we use a new version of “Ping-Pong Lemma” for semigroups embeddable in groups. At the end we present most of the known results related to semigroup free and free numbers in a common picture....
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability...
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....
The structure of the set of positive unital maps between M₂(ℂ) and Mₙ(ℂ) (n ≥ 3) is investigated. We proceed with the study of the "quantized" Choi matrix thus extending the methods of our previous paper [MM2]. In particular, we examine the quantized version of Størmer's extremality condition. Maps fulfilling this condition are characterized. To illustrate our approach, a careful analysis of Tang's maps is given.