SearcharxivSearch

arXiv · 2210.08938

Relative Dehn fuctions, hyperbolically embedded subgroups and combination theorems

Abstract

Consider the following classes of pairs consisting of a group and a finite collection of subgroups: $\mathcal{C}= \left\{ (G,\mathcal H) \mid \text{$\mathcal{H}$ is hyperbolically embedded in $G$} \right\}$ and $ \mathcal{D}= \left\{ (G,\mathcal H) \mid \text{the relative Dehn function of $(G,\mathcal H)$ is well-defined} \right\}.$ Let $G$ be a group that splits as a finite graph of groups such that each vertex group $G_v$ is assigned a finite collection of subgroups $\mathcal{H}_v$, and each edge group $G_e$ is conjugate to a subgroup of some $H\in \mathcal{H}_v$ if $e$ is adjacent to $v$. Then there is a finite collection of subgroups $\mathcal{H}$ of $G$ such that: $\bullet$ If each $(G_v, \mathcal{H}_v)$ is in $\mathcal C$, then $(G,\mathcal{H})$ is in $\mathcal C$. $\bullet$ If each $(G_v, \mathcal{H}_v)$ is in $\mathcal D$, then $(G,\mathcal{H})$ is in $\mathcal D$. $\bullet$ For any vertex $v$ and for any $g\in G_v$, the element $g$ is conjugate to an element in some $Q\in\mathcal{H}_v$ if and only if $g$ is conjugate to an element in some $H\in\mathcal{H}$. That edge groups are not assumed to be finitely generated and that they do not necessarily belong to a peripheral collection of subgroups of an adjacent vertex are the main differences between this work and previous results in the literature. The method of proof provides lower and upper bounds of the relative Dehn functions in terms of the relative Dehn functions of the vertex groups. These bounds generalize and improve analogous results in the literature.

Explore related subjects

Keep this discovery

BibTeXRIS

Hadi Bigdely, Eduardo Martínez-Pedroza. 2022-10-17. Relative Dehn fuctions, hyperbolically embedded subgroups and combination theorems. https://arxiv.org/abs/2210.08938

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