SearcharxivSearch

arXiv · 2510.10178

Embedding finitely generated free-by-cyclic groups in {finitely generated free}-by-cyclic groups

Abstract

We refine Feighn--Handel's results on subgroups of mapping tori of free groups to the special case of free-by-cyclic groups. We use these refinements to show that any finitely generated free-by-cyclic group embeds in a {finitely generated free}-by-cyclic group. When the free-by-cyclic group is hyperbolic, it embeds in a hyperbolic {finitely generated free}-by-cyclic group as a quasi-convex subgroup. Combined with a result of Hagen--Wise, this implies that all hyperbolic free-by-cyclic groups are cocompactly cubulated.

Explore related subjects

Keep this discovery

BibTeXRIS

Marco Linton. 2025-10-11. Embedding finitely generated free-by-cyclic groups in {finitely generated free}-by-cyclic groups. https://arxiv.org/abs/2510.10178

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