SearcharxivSearch

arXiv · 2505.09303

Solvable, nilpotent and supernilpotent semigroups with completely simple ideal and monoids

Abstract

Around 1980 commutator theory was generalized from groups to arbitrary algebras using the socalled term condition commutator. The semigroups that are abelian with respect to this commutator were classified by Warne (1994). We study what solvability, nilpotence, and supernilpotence in the sense of commutator theory mean for semigroups and how these notions relate to classical concepts in semigroup theory. We show that a semigroup with a completely simple ideal is solvable (left nilpotent or right nilpotent or supernilpotent) in the sense of commutator theory iff it is a nilpotent extension in the classical sense of semigroup theory of a completely simple semigroup with solvable (nilpotent) subgroups. These characterizations hold in particular for finite semigroups and for eventually regular semigroups, i.e., semigroups in which every element has some regular power. We also show that a monoid is (left and right) nilpotent in the sense of commutator theory iff it embeds into a nilpotent group.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Mayr. 2025-05-14. Solvable, nilpotent and supernilpotent semigroups with completely simple ideal and monoids. https://arxiv.org/abs/2505.09303

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR