SearcharxivSearch

arXiv · 1410.2194

The congruence $\eta^{\ast}$ on semigroups

Abstract

In this paper we define a congruence $\eta^{\ast}$ on semigroups. For the finite semigroups $S$, $\eta^{\ast}$ is the smallest congruence relation such that $S/\eta^{\ast}$ is a nilpotent semigroup (in the sense of Malcev). In order to study the congruence relation $\eta^{\ast}$ on finite semigroups, we define a $\textbf{CS}$-diagonal finite regular Rees matrix semigroup. We prove that, if $S$ is a $\textbf{CS}$-diagonal finite regular Rees matrix semigroup then $S/\eta^{\ast}$ is inverse. Also, if $S$ is a completely regular finite semigroup, then $S/\eta^{\ast}$ is a Clifford semigroup. We show that, for every non-null principal factor $A/B$ of $S$, there is a special principal factor $C/D$ such that every element of $A\setminus B$ is $\eta^{\ast}$-equivalent with some element of $C\setminus D$. We call the principal factor $C/D$, the $\eta^{\ast}$-root of $A/B$. All $\eta^{\ast}$-roots are $\textbf{CS}$-diagonal. If certain elements of $S$ act in the special way on the $\textbf{R}$-classes of a $\textbf{CS}$-diagonal principal factor then it is not an $\eta^{\ast}$-root. Some of these results are also expressed in terms of pseudovarieties of semigroups.

Explore related subjects

Keep this discovery

BibTeXRIS

M. H. Shahzamanian. 2014-10-08. The congruence $\eta^{\ast}$ on semigroups. https://doi.org/10.1093/qmath/haw017

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