SearcharxivSearch

arXiv · 1902.02378

Retracts of free groups and a question of Bergman

Abstract

Let $F_n$ be a free group of finite rank $n \geq 2$. We prove that if $H$ is a subgroup of $F_n$ with $\textrm{rk}(H)=2$ and $R$ is a retract of $F_n$, then $H \cap R$ is a retract of $H$. However, for every $m \geq 3$ and every $1 \leq k \leq n-1$, there exist a subgroup $H$ of $F_n$ of rank $m$ and a retract $R$ of $F_n$ of rank $k$ such that $H \cap R$ is not a retract of $H$. This gives a complete answer to a question of Bergman. Furthermore, we provide positive evidence for the inertia conjecture of Dicks and Ventura. More precisely, we prove that $\textrm{rk}(H \cap \textrm{Fix}(S)) \leq \textrm{rk}(H)$ for every family $S$ of endomorphisms of $F_n$ and every subgroup $H$ of $F_n$ with $\textrm{rk}(H) \leq 3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilir Snopce, Slobodan Tanushevski, Pavel Zalesskii. 2019-02-06. Retracts of free groups and a question of Bergman. https://arxiv.org/abs/1902.02378

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