SearcharxivSearch

arXiv · 2601.22789

Generators for automorphisms of special groups

Abstract

Let $G$ be a (compact) special group in the sense of Haglund and Wise. We show that ${\rm Out}(G)$ is finitely generated, and provide a virtual generating set consisting of Dehn twists and ``pseudo-twists''. We exhibit instances where Dehn twists alone do not suffice and completely characterise this phenomenon: it is caused by certain abelian subgroups of $G$, called ``poison subgroups'', which can be removed by replacing $G$ with a finite-index subgroup. Similar results hold for coarse-median preserving automorphisms, without the pathologies: For every special group $G$, the coarse-median preserving subgroups ${\rm Out}(G,[\mu])\leq{\rm Out}(G)$ are virtually generated by finitely many Dehn twists with respect to splittings of $G$ over centralisers. Proofs are based on a novel, hierarchical version of Rips and Sela's shortening argument.

Explore related subjects

Keep this discovery

BibTeXRIS

Elia Fioravanti. 2026-01-30. Generators for automorphisms of special groups. https://arxiv.org/abs/2601.22789

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