SearcharxivSearch

arXiv · 1608.00617

On rank of the join of two subgroups in a free group

Abstract

Let $H, K$ be two finitely generated subgroups of a free group, let $\langle H, K \rangle$ denote the subgroup generated by $H, K$, called the join of $H, K$, and let neither of $H$, $K$ have finite index in $\langle H, K \rangle$. We prove the existence of an epimorphism $\zeta : \langle H, K \rangle \to F_2$, where $F_2$ is a free group of rank 2, such that the restriction of $\zeta$ on both $H$ and $K$ is injective and the restriction $\zeta_0 : H \cap K \to \zeta (H) \cap \zeta (K) $ of $\zeta$ on $H \cap K $ to $\zeta (H) \cap \zeta (K)$ is surjective. This is obtained as a corollary of an analogous result on rank of the generalized join of two finitely generated subgroups in a free group.

Explore related subjects

Keep this discovery

BibTeXRIS

Sergei V. Ivanov. 2016-08-01. On rank of the join of two subgroups in a free group. https://arxiv.org/abs/1608.00617

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