SearcharxivSearch

arXiv · 1203.2429

A description of a class of finite semigroups that are near to being Malcev nilpotent

Abstract

In this paper we continue the investigations on the algebraic structure of a finite semigroup $S$ that is determined by its associated upper non-nilpotent graph $\mathcal{N}_{S}$. The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent (in the sense of Malcev). We introduce a class of semigroups in which the Mal'cev nilpotent property lifts through ideal chains. We call this the class of \B\ semigroups. The definition is such that the global information that a semigroup is not nilpotent induces local information, i.e. some two-generated subsemigroups are not nilpotent. It turns out that a finite monoid (in particular, a finite group) is \B\ if and only if it is nilpotent. Our main result is a description of \B\ finite semigroups $S$ in terms of their associated graph ${\mathcal N}_{S}$. In particular, $S$ has a largest nilpotent ideal, say $K$, and $S/K$ is a 0-disjoint union of its connected components (adjoined with a zero) with at least two elements.

Explore related subjects

Keep this discovery

BibTeXRIS

E. Jespers, M. H. Shahzamanian. 2012-11-06. A description of a class of finite semigroups that are near to being Malcev nilpotent. https://doi.org/10.1142/s0219498812502210

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