Asymptotic dimension of Artin groups and a new upper bound for Coxeter groups
Abstract
If A (W) is the Artin (Coxeter) group with defining graph we denote by Sim() the number of vertices of the largest clique in . We show that asdimA ≤ Sim(), if Sim()=2. We conjecture that the inequality holds for every Artin group. We prove that if for all free of infinity Artin (Coxeter) groups the conjecture holds, then it holds for all Artin (Coxeter) groups. As a corollary, we show that asdimW ≤ Sim() for all Coxeter groups, which is the best known upper bound for the asymptotic dimension of Coxeter Groups. As a further corollary, we show that the asymptotic dimension of any Artin group of large type with Sim()=3 is exactly two.
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.