SearcharxivSearch

arXiv · 2608.07191

A Brown Theorem for Dehn functions of graphs of groups

Abstract

We prove an upper bound on the Dehn function of a group $G$ acting cellularly, cocompactly, and without inversions on a simply connected CW complex $X$ in terms of the Dehn functions of the vertex stabilizers, the Dehn function of $X$, and the distortion of the edge stabilizers, provided that $X$ is either a tree or the stabilizer of each $2$-cell has finite index in the stabilizer of every edge in its boundary. This provides a Dehn function analogue of Brown's Theorem for finiteness properties and an answer to a question of Zaremsky in these cases. We also prove analogues of our result for higher Dehn functions when $X$ is a tree.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Claudio Llosa Isenrich, Jannis Weis. 2026-08-07. A Brown Theorem for Dehn functions of graphs of groups. https://arxiv.org/abs/2608.07191

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