SearcharxivSearch

arXiv · 1201.0989

The simplicial boundary of a CAT(0) cube complex

Abstract

For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_Δ\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare $\partial_Δ\mathbf X$ to the Roller, visual, and Tits boundaries of $\mathbf X$ and give conditions under which the natural CAT(1) metric on $\partial_Δ\mathbf X$ makes it (quasi)isometric to the Tits boundary. $\partial_Δ\mathbf X$ allows us to interpolate between studying geodesic rays in $\mathbf X$ and the geometry of its \emph{contact graph} $Γ\mathbf X$, which is known to be quasi-isometric to a tree, and we characterize essential cube complexes for which the contact graph is bounded. Using related techniques, we study divergence of combinatorial geodesics in $\mathbf X$ using $\partial_Δ\mathbf X$. Finally, we rephrase the rank-rigidity theorem of Caprace-Sageev in terms of group actions on $Γ\mathbf X$ and $\partial_Δ\mathbf X$ and state characterizations of cubulated groups with linear divergence in terms of $Γ\mathbf X$ and $\partial_Δ\mathbf X$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark F. Hagen. 2020-04-06. The simplicial boundary of a CAT(0) cube complex. https://doi.org/10.2140/agt.2013.13.1299

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