Asymptotic dimension of Artin groups and a new upper bound for Coxeter groups
Panagiotis Tselekidis

TL;DR
This paper investigates the asymptotic dimension of Artin and Coxeter groups, establishing new bounds related to the clique number of their defining graphs, and conjectures a general inequality for all such groups.
Contribution
It introduces a new upper bound for the asymptotic dimension of Artin and Coxeter groups based on the clique number, and proves the bound for specific cases, advancing understanding of their geometric properties.
Findings
Proves that if the conjecture holds for free of infinity Artin groups, it holds for all.
Establishes that the asymptotic dimension of Coxeter groups is bounded by the clique number.
Shows that Artin groups of large type with clique number 3 have asymptotic dimension exactly two.
Abstract
If () is the Artin (Coxeter) group with defining graph we denote by the number of vertices of the largest clique in . We show that , if . 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 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 is exactly two.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Finite Group Theory Research
