A new upper bound for the Asymptotic Dimension of RACGs
Abstract
Let W be the Right-Angled Coxeter group with defining graph . We show that the asymptotic dimension of W is smaller than or equal to dimCC(), the clique-connected dimension of the graph. As a corollary we show that W is virtually free if and only if dimCC()=1.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.