SearcharxivSearch

arXiv · 2402.05875

Generators and presentations of inverse subsemigroups of the monogenic free inverse semigroup

Abstract

It was proved by Oliveira and Silva (2005) that every finitely generated inverse subsemigroup of the monogenic free inverse semigroup $FI_1$ is finitely presented. The present paper continues this development, and gives generating sets and presentations for general (i.e. not necessarily finitely generated) inverse subsemigroups of $FI_1$. For an inverse semigroup $S$ and an inverse subsemigroup $T$ of $S$, we say $S$ is finitely generated modulo $T$ if there is a finite set $A$ such that $S = \langle T, A \rangle$. Likewise, we say that $S$ is finitely presented modulo $T $ if $S$ can be defined by a presentation of the form $\text{Inv}\langle X, Y \mid R, Q\rangle$, where $\text{Inv}\langle X\mid R\rangle$ is a presentation for $T$ and $Y$ and $Q$ are finite. We show that every inverse subsemigroup $S$ of $FI_1$ is finitely generated modulo its semilattice of idempotents $E(S)$. By way of contrast, we show that when $S\neq E(S)$, it can never be finitely presented modulo $E(S)$. However, in the process we establish some nice (albeit infinite) presentations for $S$ modulo $E(S)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jung Won Cho, Nik Ruskuc. 2024-02-08. Generators and presentations of inverse subsemigroups of the monogenic free inverse semigroup. https://arxiv.org/abs/2402.05875

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