SearcharxivSearch

arXiv · 1607.08899

Boundary convex cocompactness and stability of subgroups of finitely generated groups

Abstract

A Kleinian group $\Gamma < \mathrm{Isom}(\mathbb H^3)$ is called convex cocompact if any orbit of $\Gamma$ in $\mathbb H^3$ is quasiconvex or, equivalently, $\Gamma$ acts cocompactly on the convex hull of its limit set in $\partial \mathbb H^3$. Subgroup stability is a strong quasiconvexity condition in finitely generated groups which is intrinsic to the geometry of the ambient group and generalizes the classical quasiconvexity condition above. Importantly, it coincides with quasiconvexity in hyperbolic groups and convex cocompactness in mapping class groups. Using the Morse boundary, we develop an equivalent characterization of subgroup stability which generalizes the above boundary characterization from Kleinian groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthew Cordes, Matthew Gentry Durham. 2016-07-29. Boundary convex cocompactness and stability of subgroups of finitely generated groups. https://arxiv.org/abs/1607.08899

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