SearcharxivSearch

arXiv · 1509.00632

Hierarchically hyperbolic spaces II: Combination theorems and the distance formula

Abstract

We introduce a number of tools for finding and studying \emph{hierarchically hyperbolic spaces (HHS)}, a rich class of spaces including mapping class groups of surfaces, Teichm\"{u}ller space with either the Teichm\"{u}ller or Weil-Petersson metrics, right-angled Artin groups, and the universal cover of any compact special cube complex. We begin by introducing a streamlined set of axioms defining an HHS. We prove that all HHSs satisfy a Masur-Minsky-style distance formula, thereby obtaining a new proof of the distance formula in the mapping class group without relying on the Masur-Minsky hierarchy machinery. We then study examples of HHSs; for instance, we prove that when $M$ is a closed irreducible $3$--manifold then $\pi_1M$ is an HHS if and only if it is neither $Nil$ nor $Sol$. We establish this by proving a general combination theorem for trees of HHSs (and graphs of HH groups). We also introduce a notion of "hierarchical quasiconvexity", which in the study of HHS is analogous to the role played by quasiconvexity in the study of Gromov-hyperbolic spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Jason Behrstock, Mark F. Hagen, Alessandro Sisto. 2015-09-02. Hierarchically hyperbolic spaces II: Combination theorems and the distance formula. https://doi.org/10.2140/pjm.2019.299.257

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