SearcharxivSearch

arXiv · 2507.06600

Maximal subgroups of free projection- and idempotent-generated semigroups with applications to partition monoids

Abstract

This paper investigates the maximal subgroups of a free projection-generated regular $*$-semigroup $PG(P)$ over a projection algebra $P$, and their relationship to the maximal subgroups of the free idempotent-generated semigroup $IG(E)$ over the corresponding biordered set $E = E(P)$. In the first part of the paper we obtain a number of general presentations by generators and defining relations, in each case reflecting salient combinatorial/topological properties of the groups. In the second part we apply these to explicitly compute the groups when $P = P(P_n)$ and $E = E(P_n)$ arise from the partition monoid $P_n$. Specifically, we show that the maximal subgroup of $PG(P(P_n))$ corresponding to a projection of rank $r\leq n-2$ is (isomorphic to) the symmetric group $S_r$. In $IG(E(P_n))$, the corresponding subgroup is the direct product $Z \times S_r$. The appearance of the infinite cyclic group $Z$ is explained by a connection to a certain twisted partition monoid $P_n^\Phi$, which has the same biordered set as $P_n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James East, Robert D. Gray, P. A. Azeef Muhammed, Nik Ruskuc. 2025-07-09. Maximal subgroups of free projection- and idempotent-generated semigroups with applications to partition monoids. https://arxiv.org/abs/2507.06600

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