A new upper bound for the Asymptotic Dimension of RACGs
Panagiotis Tselekidis

TL;DR
This paper establishes a new upper bound for the asymptotic dimension of Right-Angled Coxeter groups based on the clique-connected dimension of their defining graphs, linking geometric properties to graph invariants.
Contribution
The paper introduces a novel upper bound for the asymptotic dimension of RACGs using clique-connected dimension and characterizes when these groups are virtually free.
Findings
Asymptotic dimension of RACGs is bounded above by clique-connected dimension of the defining graph.
RACGs are virtually free if and only if the clique-connected dimension of the graph is 1.
Provides a new geometric-combinatorial link between group properties and graph invariants.
Abstract
Let be the Right-Angled Coxeter group with defining graph . We show that the asymptotic dimension of is smaller than or equal to , the clique-connected dimension of the graph. As a corollary we show that is virtually free if and only if .
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
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Topological and Geometric Data Analysis
