Search arXivSearch

arXiv · 1910.09601

Incoherence and fibering of many free-by-free groups

Abstract

We show that free-by-free groups satisfying a homological criterion, which we call excessive homology, are incoherent. This class is large in nature, including many examples of hyperbolic and non-hyperbolic free-by-free groups. We apply this criterion to finite index subgroups of $F_2\rtimes F_n$ to show incoherence of all such groups, and to other similar classes of groups. Furthermore, we show that a large class of groups, including free-by-free, surface-by-surface, and finitely generated-by-RAAG, algebraically fiber if they have excessive homology.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Kropholler, Genevieve Walsh. 2019-10-21. Incoherence and fibering of many free-by-free groups. https://arxiv.org/abs/1910.09601

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