SearcharxivSearch

arXiv · 2501.06676

Left reductive regular semigroups

Abstract

In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is `embedded' inside the left ideal one, and so we can construct these semigroups starting with only one object (unlike in other more general cases). To this end, we introduce an upgraded version of Nambooripad's normal category as our building block, which we call a connected category. The main theorem of the paper describes a category equivalence between the category of left (and right) reductive regular semigroups and the category of connected categories. Then, we specialise our result to describe constructions of L- (and R-) unipotent semigroups, right (and left) regular bands, inverse semigroups and arbitrary regular monoids. Finally, we provide concrete (and rather simple) descriptions to the connected categories that arise from finite transformation semigroups, linear transformation semigroups (over a finite dimensional vector space) and symmetric inverse monoids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

P. A. Azeef Muhammed, Gracinda M. S. Gomes. 2025-01-12. Left reductive regular semigroups. https://arxiv.org/abs/2501.06676

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