The simplicial boundary of a CAT(0) cube complex

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

For a CAT(0) cube complex $\mathbf X$, we define a simplicial complex $\simp\mathbf X$, called the \emph{simplicial boundary}. $\simp\mathbf X$ differs from the Tits boundary, the Roller boundary, and the visual boundary of $\mathbf X$. The simplicial boundary is the natural setting for studying non-hyperbolic behavior of $\mathbf X$. The simplicial boundary allows us to interpolate between studying geodesic rays in $\mathbf X$ and the geometry of its \emph{contact graph}, which is known to be quasi-isometric to a tree. Using the simplicial boundary, we characterize essential cube complexes for which the contact graph is bounded. We show that the rank-one isometries of $\mathbf X$ that do not virtually stabilize hyperplanes are exactly those isometries of $\mathbf X$ that act with an unbounded quasiconvex orbit on the contact graph. Conversely, we state a form of the Caprace-Sageev rank-rigidity theorem in terms of the contact graph. Using this statement and properties of the simplicial boundary, we study the divergence of groups acting properly and cocompactly on CAT(0) cube complexes, generalizing a result of Behrstock-Charney for right-angled Artin groups.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The simplicial boundary of a CAT(0) cube complex does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The simplicial boundary of a CAT(0) cube complex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The simplicial boundary of a CAT(0) cube complex will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-608340

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.