SearcharxivSearch

arXiv · 2508.02582

Topological Full Groups of Irreducible Edge Shifts have Solvable Conjugacy Problem

Abstract

In this paper, we solve the conjugacy problem for Topological Full Groups of Irreducible Edge Shifts, introduced by Matui in 2015 and later recontextualized as groups of almost automorphisms of trees by Lederle in 2020. The techniques we use work in a larger class of groups, that of Piecewise-Canonical Homeomorphisms of Edge Shifts (which are essentially the prefix-exchange transformations), which also includes the Houghton groups and the Thompson-like group $QV$, for example. We use strand diagrams, first developed by Belk and Matucci in 2014 to solve the conjugacy problem in Thompson's groups $F$, $T$ and $V$. In addition to strand diagrams, to solve for so-called type 3 reductions we will employ certain commutative semigroups of loops.

Explore related subjects

Keep this discovery

BibTeXRIS

Matteo Tarocchi. 2025-08-04. Topological Full Groups of Irreducible Edge Shifts have Solvable Conjugacy Problem. https://arxiv.org/abs/2508.02582

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