SearcharxivSearch

arXiv · 2406.19860

Dehn functions of subgroups of products of free groups. Part I: Uniform upper bounds

Abstract

Subgroups of direct products of finitely many finitely generated free groups form a natural class that plays an important role in geometric group theory. Its members include fundamental examples, such as the Stallings-Bieri groups. This raises the problem of understanding their geometric invariants. We prove that finitely presented subgroups of direct products of three free groups, as well as subgroups of finiteness type $\mathcal{F}_{n-1}$ in a direct product of $n$ free groups, have Dehn function bounded above by $N^9$. This gives a positive answer to a question of Dison within these important subclasses and provides new insights in the context of Bridson's conjecture stating that finitely presented subgroups of direct products of free groups have polynomially bounded Dehn function. To prove our results we generalise techniques for "pushing fillings" into normal subgroups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dario Ascari, Federica Bertolotti, Giovanni Italiano, Claudio Llosa Isenrich, Matteo Migliorini. 2024-06-28. Dehn functions of subgroups of products of free groups. Part I: Uniform upper bounds. https://arxiv.org/abs/2406.19860

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