SearcharxivSearch

arXiv · 2009.10052

A McCool Whitehead type theorem for finitely generated subgroups of $\mathsf{Out}(F_n)$

Abstract

S. Gersten announced an algorithm that takes as input two finite sequences $\vec K=(K_1,\dots, K_N)$ and $\vec K'=(K_1',\dots, K_N')$ of conjugacy classes of finitely generated subgroups of $F_n$ and outputs: (1) $\mathsf{YES}$ or $\mathsf{NO}$ depending on whether or not there is an element $\theta\in \mathsf{Out}(F_n)$ such that $\theta(\vec K)=\vec K'$ together with one such $\theta$ if it exists and (2) a finite presentation for the subgroup of $\mathsf{Out}(F_n)$ fixing $\vec K$. S. Kalajd\v{z}ievski published a verification of this algorithm. We present a different algorithm from the point of view of Culler-Vogtmann's Outer space. New results include that the subgroup of $\mathsf{Out}(F_n)$ fixing $\vec K$ is of type $\mathsf{VF}$, an equivariant version of these results, an application, and a unified approach to such questions.

Explore related subjects

Keep this discovery

BibTeXRIS

Mladen Bestvina, Mark Feighn, Michael Handel. 2020-09-21. A McCool Whitehead type theorem for finitely generated subgroups of $\mathsf{Out}(F_n)$. https://arxiv.org/abs/2009.10052

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