SearcharxivSearch

arXiv · 2607.05713

Accessibility and Twin-width

Abstract

We show that finite twin-width does not imply accessibility for finitely generated groups, which answers a question of Esperet. That is, we prove that there exists a finitely generated group $\Gamma$ that has finite uniform twin-width but is not accessible. In particular, for every finite generating set $S$ of $\Gamma$, the Cayley graph $Cay(\Gamma ; S)$ has finite twin-width but is not accessible. The example is obtained by combining Wilkes construction of a finitely generated inaccessible residually $p$-finite groups with a result of Bonnet, Geniet, Tessera and Thomasse regarding the twin-width of groups acting faithfully on regular rooted trees.

Explore related subjects

Keep this discovery

BibTeXRIS

George Kontogeorgiou, Bobby Miraftab. 2026-07-07. Accessibility and Twin-width. https://arxiv.org/abs/2607.05713

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