SearcharxivSearch

arXiv · 1707.06868

Nilpotency and strong nilpotency for finite semigroups

Abstract

Nilpotent semigroups in the sense of Mal'cev are defined by semigroup identities. Finite nilpotent semigroups constitute a pseudovariety, $\mathsf{MN}$, which has finite rank. The semigroup identities that define nilpotent semigroups, lead us to define strongly Mal'cev nilpotent semigroups. Finite strongly Mal'cev nilpotent semigroups constitute a non-finite rank pseudovariety, $\mathsf{SMN}$. The pseudovariety $\mathsf{SMN}$ is strictly contained in the pseudovariety $\mathsf{MN}$ but all finite nilpotent groups are in $\mathsf{SMN}$. We show that the pseudovariety $\mathsf{MN}$ is the intersection of the pseudovariety $\mathsf{BG_{nil}}$ with a pseudovariety defined by a $\kappa$-identity. We further compare the pseudovarieties $\mathsf{MN}$ and $\mathsf{SMN}$ with the Mal'cev product of the pseudovarieties $\mathsf{J}$ and $\mathsf{G_{nil}}$.

Explore related subjects

Keep this discovery

BibTeXRIS

J. Almeida, M. Kufleitner, M. H. Shahzamanian. 2017-07-21. Nilpotency and strong nilpotency for finite semigroups. https://doi.org/10.1093/qmath%2Fhay059

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