SearcharxivSearch

arXiv · 2507.09784

On bireversible automata and commensurators of groups in automorphisms of their Cayley graphs

Abstract

If $G$ is a finitely generated group and $X$ is a Cayley graph of $G$, denote by $\mathcal{C}_1^X(G)$ the subgroup of all automorphisms of $X$ commensurating $G$ and fixing the vertex corresponding to the identity. Building on the work of Macedo\'{n}ska, Nekrashevych and Sushchansky, we observe that $\mathcal{C}_1^X(G)$ can be expressed as a directed union of groups generated by bireversible automata. We use this to to show that every cyclic subgroup of $\mathcal{C}_1^X(G)$ is undistorted and to obtain a necessary condition on $G$ for $\mathcal{C}_1^X(G)$ not to be locally finite. As a consequence, we prove that several families of groups cannot be generated by bireversible automata and show that the set of groups generated by bireversible automata is strictly contained in the set of groups generated by invertible and reversible automata.

Explore related subjects

Keep this discovery

BibTeXRIS

Dominik Francoeur. 2025-07-13. On bireversible automata and commensurators of groups in automorphisms of their Cayley graphs. https://arxiv.org/abs/2507.09784

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