Showing papers on "Cancellative semigroup published in 2021"

Truncations of ordered abelian groups

Abstract: We give axioms for a class of ordered structures, called truncated ordered abelian groups (TOAG’s) carrying an addition. TOAG’s come naturally from ordered abelian groups with a 0 and a $$+$$ , but the addition of a TOAG is not necessarily even a cancellative semigroup. The main examples are initial segments $$[0, \tau ]$$ of an ordered abelian group, with a truncation of the addition. We prove that any model of these axioms (i.e. a truncated ordered abelian group) is an initial segment of an ordered abelian group. We define Presburger TOAG’s, and give a criterion for a TOAG to be a Presburger TOAG, and for two Presburger TOAG’s to be elementarily equivalent, proving analogues of classical results on Presburger arithmetic. Their main interest for us comes from the model theory of certain local rings which are quotients of valuation rings valued in a truncation [0, a] of the ordered group $${\mathbb {Z}}$$ or more general ordered abelian groups, via a study of these truncations without reference to the ambient ordered abelian group. The results are used essentially in a forthcoming paper (D’Aquino and Macintyre, The model theory of residue rings of models of Peano Arithmetic: The prime power case, 2021, arXiv:2102.00295 ) in the solution of a problem of Zilber about the logical complexity of quotient rings, by principal ideals, of nonstandard models of Peano arithmetic.

On the complexity of inverse semigroup conjugacy

Abstract: We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether an inverse monoid is factorizable. We describe a connection between checking ~i conjugacy and checking membership in inverse semigroups. We prove that ~o and ~c are partition covering for any countable set and that ~p, ~p* , and ~tr are partition covering for any finite set. Finally, we prove that checking for nilpotency, R-triviality, and central idempotents in partial bijection semigroups are NL-complete problems and we extend several complexity results for partial bijection semigroups to inverse semigroups.

The Operator Norm on Weighted Discrete Semigroup Algebras $\ell^1(S, \omega)$

Abstract: Let $\omega$ be a weight on a right cancellative semigroup $S$. Let $\|\cdot\|_{\omega}$ be the weighted norm on the weighted discrete semigroup algebra $\ell^1(S, \omega)$. In this paper, we prove that the weight $\omega$ satisfies F-property if and only if the operator norm $\| \cdot \|_{\omega op}$ of $\| \cdot \|_{\omega}$ is exactly equal to another weighted norm $\| \cdot \|_{\widetilde{\omega}_1}$ [Theorem 2.5 ($iii$)]. Though its proof is elementary, the result is unexpectedly surprising. In particular, $\| \cdot \|_{1 op}$ is same as $\| \cdot \|_1$ on $\ell^1(S)$. Moreover, various examples are discussed to understand the relating among $\| \cdot \|_{\omega op}$, $\| \cdot \|_{\omega}$, and $\ell^1(S, \omega)$.

On Hua semigroups

Abstract: A semigroup is called a Hua semigroup if any mapping h:S→S satisfying (∀a,b∈S) h(ab)=h(a)h(b) or h(b)h(a) is either a homomorphism or an anti-homomorphism. We use this name for such a semigroup sin...

Factoring the Dedekind-Frobenius determinant of a semigroup

Abstract: The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if the complex semigroup algebra is Frobenius, and so our results include applications to the study of Frobenius semigroup algebras. We explicitly factor the semigroup determinant for commutative semigroups and inverse semigroups. We recover the Wilf-Lindstrom factorization of the semigroup determinant of a meet semilattice and Wood's factorization for a finite commutative chain ring. The former was motivated by combinatorics and the latter by coding theory over finite rings. We prove that the algebra of the multiplicative semigroup of a finite Frobenius ring is Frobenius over any field whose characteristic doesn't divide that of the ring. As a consequence we obtain an easier proof of Kovacs's theorem that the algebra of the monoid of matrices over a finite field is a direct product of matrix algebras over group algebras of general linear groups (outside of the characteristic of the finite field).

Categorically closed countable semigroups

Abstract: In this paper we establish a connection between categorical closedness and topologizability of semigroups. In particular, for a class $\mathsf T_{\!1}\mathsf S$ of $T_1$ topological semigroups we prove that a countable semigroup $X$ with finite-to-one shifts is injectively $\mathsf T_{\!1}\mathsf S$-closed if and only if $X$ is $\mathsf{T_{\!1}S}$-nontopologizable in the sense that every $T_1$ semigroup topology on $X$ is discrete. Moreover, a countable cancellative semigroup $X$ is absolutely $\mathsf T_{\!1}\mathsf S$-closed if and only if every homomorphic image of $X$ is $\mathsf T_{\!1}\mathsf S$-nontopologizable. Also, we introduce and investigate a notion of a polybounded semigroup. It is proved that a countable semigroup $X$ with finite-to-one shifts is polybounded if and only if $X$ is $\mathsf T_{\!1}\mathsf S$-closed if and only if $X$ is $\mathsf T_{\!z}\mathsf S$-closed, where $\mathsf T_{\!z}\mathsf S$ is a class of zero-dimensional Tychonoff topological semigroups. We show that polyboundedness provides an automatic continuity of the inversion in $T_1$ paratopological groups and prove that every cancellative polybounded semigroup is a group.