Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.11310

Regular semigroups weakly generated by idempotents

Luís Oliveira
View original source ↗Read source document ↗Export metadata ↓

Abstract

A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly generated by |X| idempotents such that all other regular semigroups weakly generated by |X| idempotents are homomorphic images of FI(X). The semigroup FI(X) is defined by a presentation $\langle G(X),\rho_e\cup\rho_s\rangle$ and its structure is studied. Although each of the sets $G(X)$, $\rho_e$, and $\rho_s$ is infinite for $|X|\geq 2$, we show that the word problem is decidable as each congruence class has a canonical form. If $FI_n$ denotes FI(X) for $|X|=n$, we prove also that $FI_2$ contains copies of all $FI_n$ as subsemigroups. As a consequence, we conclude that (i) all regular semigroups weakly generated by a finite set of idempotents, which include all finitely idempotent generated regular semigroups, strongly divide $FI_2$; and (ii) all finite semigroups divide $FI_2$.

Explore related subjects

math.GRmath.CO

Keep this discovery

BibTeXRIS

Luís Oliveira. 2021-12-21. Regular semigroups weakly generated by idempotents. https://arxiv.org/abs/2112.11310

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗