SearcharxivSearch

arXiv · 2406.19294

Short presentations for transformation monoids

Abstract

By the theorems of Cayley and Vagner-Preston, the full transformation monoids and the symmetric inverse monoids play analogous roles in the theory of monoids and inverse monoids, as the symmetric groups do in the theory of groups. Every presentation for the finite full transformation monoids $T_n$, symmetric inverse monoids $I_n$, and partial transformation monoids $PT_n$ contains a monoid presentation for the symmetric group. In this paper we show that the number of relations required, in addition to those for the symmetric group, for each of these monoids is at least $4$, $3$, and $8$, respectively. We also give presentations for: $T_n$ with $4$ additional relations when $n\geq 7$; for $I_n$ with $3$ additional relations for all $n \geq 3$; and for $PT_n$ with $8$ additional relations for all $n\geq 7$. The presentations for $T_n$ and $I_n$ answer open problems in the literature.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Aird, James D. Mitchell, Murray T. Whyte. 2024-06-27. Short presentations for transformation monoids. https://arxiv.org/abs/2406.19294

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