SearcharxivSearch

arXiv · 2312.16976

$E$-unitary and $F$-inverse monoids, and closure operators on group Cayley graphs

Abstract

We show that the category of $X$-generated $E$-unitary inverse monoids with greatest group image $G$ is equivalent to the category of $G$-invariant, finitary closure operators on the set of connected subgraphs of the Cayley graph of $G$. Analogously, we study $F$-inverse monoids in the extended signature $(\cdot, 1, ^{-1}, ^\mathfrak{m})$, and show that the category of $X$-generated $F$-inverse monoids with greatest group image $G$ is equivalent to the category of $G$-invariant, finitary closure operators on the set of all subgraphs of the Cayley graph of $G$. As an application, we show that presentations of $F$-inverse monoids in the extended signature can be studied by tools analogous to Stephen's procedure in inverse monoids, in particular, we introduce the notions of $F$-Sch\"utzenberger graphs and $P$-expansions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nóra Szakács. 2023-12-28. $E$-unitary and $F$-inverse monoids, and closure operators on group Cayley graphs. https://arxiv.org/abs/2312.16976

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