SearcharxivSearch

arXiv · 2203.12638

Bounded subgroups of relatively finitely presented groups

Abstract

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is conjugate into a peripheral subgroup. As an application, we obtain a trichotomy for subgroups of relatively hyperbolic groups. Moreover we prove the existence of the relative exponential growth rate for all subgroups of limit groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Eduard Schesler. 2022-03-23. Bounded subgroups of relatively finitely presented groups. https://doi.org/10.2140/agt.2024.24.1551

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