Quasi-isometry invariants of weakly special square complexes
arXiv:2009.03865 · doi:10.1016/j.topol.2021.107945
Abstract
We define the intersection complex for the universal cover of a compact weakly special square complex and show that it is a quasi-isometry invariant. By using this quasi-isometry invariant, we study the quasi-isometric classification of 2-dimensional right-angled Artin groups and planar graph 2-braid groups. Our results cover two well-known cases of 2-dimensional right-angled Artin groups: (1) those whose defining graphs are trees and (2) those whose outer automorphism groups are finite. Finally, we show that there are infinitely many graph 2-braid groups which are quasi-isometric to right-angled Artin groups and infinitely many which are not.
arXiv commentWe have changed the terminology `special cacti' to `simplest cacti' since the previous definition was not enough to cover the results about graph 2-braid groups in the paper. The corrigendum will appear in Topology and its applications. This is a unified version of the previous paper and its corrigendum (everything appeared in the corrigendum has been corrected)
References in corpus (16)
- Rank rigidity for CAT(0) cube complexes
- Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups
- Discrete Morse theory and graph braid groups
- Quasiflats in CAT(0) complexes
- Weak hyperbolicity of cube complexes and quasi-arboreal groups
- Quasi-isometric classification of graph manifold groups
- On the cohomology rings of tree braid groups
- Anti-trees and right-angled Artin subgroups of braid groups
- Top dimensional quasiflats in cube complexes
- A metric Kan-Thurston theorem
- Quasi-isometric classification of right-angled Artin groups I: the finite out case
- Abrams's stable equivalence for graph braid groups
- Groups quasi-isometric to RAAG's
- The geometry of the curve graph of a right-angled Artin group
- Right-angled Artin subgroups of the diffeomorphism group of the real line
- Embedding right-angled Artin groups into graph braid groups