SearcharxivSearch

arXiv · math/0209191

Homomorphisms from automorphism groups of free groups

Abstract

The automorphism group of a finitely generated free group is the normal closure of a single element of order 2. If $m$ is less than $n$ then a homomorphism $Aut(F_n)\to Aut(F_m)$ can have cardinality at most 2. More generally, this is true of homomorphisms from $\Aut(F_n)$ to any group that does not contain an isomorphic copy of the symmetric group $S_{n+1}$. Strong constraints are also obtained on maps to groups that do not contain a copy of $W_n= (\Bbb Z/2)^n\rtimes S_n$, or of $\Bbb Z^{n-1}$. These results place constraints on how $\Aut(F_n)$ can act. For example, if $n\ge 3$ then any action of $\Aut(F_n)$ on the circle (by homeomorphisms) factors through $\text{\rm{det}}:Aut(F_n) \to \Bbb Z_2$ .

Explore related subjects

Keep this discovery

BibTeXRIS

Martin R Bridson, Karen Vogtmann. 2002-09-16. Homomorphisms from automorphism groups of free groups. https://arxiv.org/abs/math/0209191

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