SearcharxivSearch

arXiv · 2111.11777

Ascending chains of free subgroups in closed hyperbolic and graph 3-manifold groups

Abstract

Takahasi and Higman independently proved that any ascending chain of subgroups of constant rank in a free group must stabilize. Kapovich and Myasnikov gave a proof of this fact in the language of graphs and Stallings folds. Using profinite techniques, Shusterman extended this constant-rank ascending chain condition to limit groups, which include closed surface groups. Motivated by Kapovich and Myasnikov's proof we provide two new proofs of this ascending chain condition for closed surface groups, and establish the ascending chain condition for free subgroups of constant rank in fundamental groups of closed hyperbolic and graph 3-manifolds. These results are now subsumed by the more general framework established in joint work with Heikamp, Kohav, and Munro which both corrected a mistake in a previous version of this paper and generalized it. The proof for closed hyperbolic 3-manifolds and graph manifolds is preserved in this unpublished note for its direct, geometric approach, which remains valid and particularly transparent.

Explore related subjects

Keep this discovery

BibTeXRIS

Edgar A. Bering IV, Nir Lazarovich. 2021-11-23. Ascending chains of free subgroups in closed hyperbolic and graph 3-manifold groups. https://arxiv.org/abs/2111.11777

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