搜索结果：completely

A ring $R$ is said to be centrally essential if for every its non-zero element $a$, there exist non-zero central elements $x$ and $y$ with $ax = y$. A ring $R$ is said to be completely centrally essential if all its factor rings are centrally essential rings. It is proved that completely centrally essential semiprimary rings are Lie nilpotent; noetherian completely centrally essential rings are strongly Lie nilpotent (in particular, every such a ring is a $PI$-ring). Every completely centrally essential ring has the classical ring of fractions which is a completely centrally essential ring. If $R$ is a commutative domain and $G$ is an arbitrary group, then any completely centrally essential group ring $RG$ is commutative.

Let $ f:(0,\infty)\rightarrow \Bbb{R} $ be a completely monotonic function. In this paper, we present some properties of this functions and several new classes of completely monotonic functions. We also give some special functions such that its have completely monotonic condition.

In this paper we generalize a specific quantized convexity structure of the generalized state space of a $C^*$-algebra and examine the associated extreme points. We introduce the notion of $P$-$C^*$-convex subsets, where $P$ is any positive operator on a Hilbert space $\mathcal{H}$. These subsets are defined with in the set of all completely positive (CP) maps from a unital $C^*$-algebra $\mathcal{A}$ into the algebra $B(\mathcal{H})$ of bounded linear maps on $\mathcal{H}$. In particular, we focus on certain $P$-$C^*$-convex sets, denoted by $\mathrm{CP}^{(P)}(\mathcal{A},B(\mathcal{H}))$, and analyze their extreme points with respect to this new convexity structure. This generalizes the existing notions of $C^*$-convex subsets and $C^*$-extreme points of unital completely positive maps. We significantly extend many of the known results regarding the $C^*$-extreme points of unital completely positive maps into the context of $P$-$C^*$-convex sets we are considering. This includes abstract characterization and structure of $P$-$C^*$-extreme points. Further, using these studies, we completely characterize the $C^*$-extreme points of the $C^*$-convex set of all contractive completely

We define and study in-depth the so-called completely inert and uniformly completely inert subgroups of Abelian groups. We curiously show that a subgroup is completely inert exactly when it is characteristically inert. Moreover, we prove that a subgroup is uniformly completely inert precisely when it is uniformly characteristically inert. These two statements somewhat strengthen recent results due to Goldsmith-Salce established for totally inert subgroups in J. Commut. Algebra (2025). Some other closely relevant things are obtained as well.

In this article, we characterize completely alternating functions on an abelian semigroup $S$ in terms of completely monotone functions on the product semigroup $S\times \mathbb Z_+$. We also discuss completely alternating sequences induced by a class of rational functions and obtain a set of sufficient conditions (in terms of it's zeros and poles) to determine them. As an application, we show a complete characterization of several classes of completely monotone functions on $\mathbb Z_+^2$ induced by rational functions in two variables. We also derive a set of necessary conditions for the complete monotonicity of the sequence $\{\prod_{i=1}^{k}\frac{(n+a_i)}{(n+b_i)}\}_{n \in \mathbb Z_+}, a_i, b_i \in (0,\infty)$

The formal study of completely prime modules was initiated by N. J. Groenewald and the current author in the paper; Completely prime submodules, {\it Int. Elect. J. Algebra}, {\bf 13}, (2013), 1--14. In this paper, the study of completely prime modules is continued. Firstly, the advantage completely prime modules have over prime modules is highlited and different situations that lead to completely prime modules given. Later, emphasis is put on fully completely prime modules, (i.e., modules whose all submodules are completely prime). For a fully completely prime left $R$-module $M$, if $a, b\in R$ and $m\in M$, then $abm=bam$, $am=a^km$ for all positive integers $k$, and either $am=abm$ or $bm=abm$. In the last section, two different torsion theories induced by the completely prime radical are given.

A subset of a discrete group $G$ is called completely Sidon if its span in $C^*(G)$ is completely isomorphic to the operator space version of the space $\ell_1$ (i.e. $\ell_1$ equipped with its maximal operator space structure). We recently proved a generalization to this context of Drury's classical union theorem for Sidon sets: completely Sidon sets are stable under finite unions. We give a different presentation of the proof emphasizing the "interpolation property" analogous to the one Drury discovered. In addition we prove the analogue of the Fatou-Zygmund property: any bounded Hermitian function on a symmetric completely Sidon set $Λ\subset G\setminus\{1\}$ extends to a positive definite function on $G$. In the final section, we give a completely isomorphic characterization of the closed span $C_Λ$ of a completely Sidon set in $C^*(G)$: the dual (in the operator space sense) of $C_Λ$ is exact iff $Λ$ is completely Sidon. In particular, $Λ$ is completely Sidon as soon as $C_Λ$ is completely isomorphic (by an arbitrary isomorphism) to $\ell_1(Λ)$ equipped with its maximal operator space structure.

I explicitly compute the Eilenberg-Mac Lane homology of a completely simple semigroup using topological means. I also complete Gray and Pride's investigation into the homological finiteness properties of completely simple semigroups, as well as studying their topological finiteness properties. I give a topological proof of Pride's unpublished homological lower bound for the deficiency of a monoid or semigroup.

A well-known theorem of Paulsen says that if $\mathcal{A}$ is a unital operator algebra and $φ:\mathcal{A}\to B(\mathcal{H})$ is a unital completely bounded homomorphism, then $φ$ is similar to a completely contractive map $φ'$. Motivated by classification problems for Hilbert space contractions, we are interested in making the inverse $φ'^{-1}$ completely contractive as well whenever the map $φ$ has a completely bounded inverse. We show that there exist invertible operators $X$ and $Y$ such that the map $$ XaX^{-1}\mapsto Yφ(a)Y^{-1} $$ is completely contractive and is "almost" isometric on any given finite set of elements from $\mathcal{A}$ with non-zero spectrum. Although the map cannot be taken to be completely isometric in general, we show that this can be achieved if $\mathcal{A}$ is completely boundedly isomorphic to either a $C^*$-algebra or a uniform algebra. In the case of quotient algebras of $H^\infty$, we translate these conditions in function theoretic terms and relate them to the classical Carleson condition.

In the setting of a self-dual cone in a finite-dimensional inner product space, we consider (zero-sum) linear games. In our previous work, we showed that a Z-transformation with positive value is completely mixed. The present paper considers the case when the value is zero. Motivated by the matrix game result that a Z-matrix with value zero is completely mixed if and only if it is irreducible, we formulate our general results based on the concepts of cone-irreducibility and space-irreducibility. While the concept of cone-irreducibility for a positive linear transformation is well-known, we introduce space-irreducibility for a general linear transformation by reformulating the irreducibility concept of Elsner. Our main result is that for a Z-transformation with value zero, space-irreducibility is necessary and sufficient for the completely mixed property. We also extend a recent result of Parthasarathy et al. on matrix games with value zero to the setting of a symmetric cone (in a Euclidean Jordan algebra). Additionally, we present a refined cone/space-irreducibility result for positive transformations on symmetric cones.

Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the supplementary code of the other one. We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius $2$, then the supplementary code is also completely regular with covering radius at most $2$. Moreover, in this case, either both codes are completely transitive, or both are not. With this technique, we obtain infinite families of completely regular and completely transitive codes which are quasi-perfect uniformly packed.

Completely positive graphs have been employed to associate with completely positive matrices for characterizing the intrinsic zero patterns. As tensors have been widely recognized as a higher-order extension of matrices, the multi-hypergraph, regarded as a generalization of graphs, is then introduced to associate with tensors for the study of complete positivity. To describe the dependence of the corresponding zero pattern for a special type of completely positive tensors--the $\{0,1\}$ completely positive tensors, the completely positive multi-hypergraph is defined. By characterizing properties of the associated multi-hypergraph, we provide necessary and sufficient conditions for any $(0,1)$ associated tensor to be $\{0,1\}$ completely positive. Furthermore, a necessary and sufficient condition for a uniform multi-hypergraph to be completely positive multi-hypergraph is proposed as well.

A problem of completing a linear map on C*-algebras to a completely positive map is analyzed. It is shown that whenever such a completion is feasible there exists a unique minimal completion. This theorem is used to show that under some very general conditions a completely positive map almost everywhere equivalent to a quasi-pure map is actually equal to that map.

An irreducible complete atomic OML of infinite height cannot both be algebraic and have the covering property. However, Kalmbach's construction provides an example of such an OML that is algebraic and has the 2-covering property, and Keller's construction provides an example of such an OML that has the covering property and is completely hereditarily atomic. Completely hereditarily atomic OMLs generalize algebraic OMLs suitably to quantum predicate logic.

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated completely simple subsemigroups of $S$ extends to an automorphism of $S$. Motivated by the study of homogeneous completely regular semigroups, we obtain a complete classification of homogeneous completely simple semigroups, modulo the group case. As a consequence, all finite regular homogeneous semigroups are described, thus extending the work of Cherlin on homogeneous finite groups.

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it satisfies two linear matrix inequalities. This result can be used to determine whether a binary tensor is completely positive or not. When it is, we give an algorithm for computing its cp-rank and the decomposition. When the order is odd, we show that the cp-rank decomposition is unique. When the order is even, we completely characterize when the cp-rank decomposition is unique. We also discuss how to compute the nearest cp-approximation when a binary tensor is not completely positive.

In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For the remaining cases, we show that the codes are not completely transitive assuming an upper bound on the order of the monomial automorphism groups, according to computational results.

Lee and Kwon [12] defined an ordered semigroup S to be completely regular if a 2 (a2Sa2] for every a 2 S. We characterize every completely regular ordered semigroup as a union of t-simple subsemigroups, and every Clifford ordered semigroup as a complete semilattice of t-simple subsemigroups. Green's Theorem for the completely regular ordered semigroups has been established. In an ordered semigroup S, we call an element e an ordered idempotent if it satisfies e ? e2. Different characterizations of the regular, completely regular and Clifford ordered semigroups are done by their ordered idempotents. Thus a foundation for the completely regular ordered semigroups and Clifford ordered semigroups has been developed

In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these "arithmetic completely regular codes", we focus on cartesian products of completely regular codes and products of their corresponding coset graphs in the additive case. Employing earlier results, we are then able to prove a theorem which nearly classifies these codes in the case where the graph admits a completely regular partition into such codes (e.g, the cosets of some additive completely regular code). Connections to the theory of distance-regular graphs are explored and several open questions are posed.