SearcharxivSearch

arXiv · 1206.5728

Centralisers of Dehn twist automorphisms of free groups

Abstract

We refine Cohen and Lustig's description of centralisers of Dehn twists of free groups. We show that the centraliser of a Dehn twist of a free group has a subgroup of finite index that has a finite classifying space. We describe an algorithm to find a presentation of the centraliser. We use this algorithm to give an explicit presentation for the centraliser of a Nielsen automorphism in Aut(F_n). This gives restrictions to actions of Aut(F_n) on CAT(0) spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Moritz Rodenhausen, Richard D. Wade. 2014-11-05. Centralisers of Dehn twist automorphisms of free groups. https://doi.org/10.1017/s0305004115000225

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