SearcharxivSearch

arXiv · 1302.2379

Subgroup decomposition in Out(F_n), Part II: A relative Kolchin theorem

Abstract

This is the second in a series of four papers (with research announcement posted on this arXiv) that together develop a decomposition theory for subgroups of Out(F_n). In this paper we relativize the "Kolchin-type theorem" from the work of Bestvina, Feighn, and Handel on the Tits alternative, which describes a decomposition theory for subgroups H of Out(F_n) all of whose elements have polynomial growth. The Relative Kolchin Theorem allows subgroups H whose elements have exponential growth, as long as all such exponential growth is cordoned off in some free factor system F which is invariant under every element of H. The conclusion is that a certain finite index subgroup of H has an invariant filtration by free factor systems going from F up to the full free factor system by individual steps each of which is a "one-edge extension". We also study the kernel of the action of Out(F_n) on homology with Z/3 coefficients, and we prove Theorem B from the research announcement, which describes strong finite permutation behavior of all elements of this kernel.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Handel, Lee Mosher. 2013-02-10. Subgroup decomposition in Out(F_n), Part II: A relative Kolchin theorem. https://arxiv.org/abs/1302.2379

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