SearcharxivSearch

arXiv · 1012.1914

The complex of partial bases for F_n and finite generation of the Torelli subgroup of Aut(F_n)

Abstract

We study the complex of partial bases of a free group, which is an analogue for $\Aut(F_n)$ of the curve complex for the mapping class group. We prove that it is connected and simply connected, and we also prove that its quotient by the Torelli subgroup of $\Aut(F_n)$ is highly connected. Using these results, we give a new, topological proof of a theorem of Magnus that asserts that the Torelli subgroup of $\Aut(F_n)$ is finitely generated.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthew B. Day, Andrew Putman. 2010-12-09. The complex of partial bases for F_n and finite generation of the Torelli subgroup of Aut(F_n). https://doi.org/10.1007/s10711-012-9765-6

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