SearcharxivSearch

arXiv · 1901.04463

Realizable ranks of joins and intersections of subgroups in free groups

Abstract

The famous Hanna Neumann Conjecture (now the Friedman-Mineyev theorem) gives an upper bound for the ranks of the intersection of arbitrary subgroups $H$ and $K$ of a non-abelian free group. It is an interesting question to `quantify' this bound with respect to the rank of $H\vee K$, the subgroup generated by $H$ and $K$. We describe a set of realizable values $(rk(H\vee K),rk(H\cap K))$ for arbitrary $H$, $K$, and conjecture that this locus is complete. We study the combinatorial structure of the topological pushout of the core graphs for $H$ and $K$, with the help of graphs introduced by Dicks in the context of his Amalgamated Graph Conjecture. This allows us to show that certain conditions on ranks of $H\vee K$, $H\cap K$ are not realizable, thus resolving the remaining open case $m=4$ of Guzman's "Group-Theoretic Conjecture" in the affirmative. This in turn implies the validity of the corresponding "Geometric Conjecture" on hyperbolic $3$-manifolds with a $6$-free fundamental group. Finally, we prove the main conjecture describing the locus of realizable values for the case when $rk(H)=2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ignat Soroko. 2019-01-14. Realizable ranks of joins and intersections of subgroups in free groups. https://doi.org/10.1142/s0218196720500149

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