Papers › Divergence, thickness and hypergraph index for general Coxeter groups
Divergence, thickness and hypergraph index for general Coxeter groups
Pallavi Dani, Yusra Naqvi, Ignat Soroko, Anne Thomas
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study divergence and thickness for general Coxeter groups W. We first characterise linear divergence, and show that if W has superlinear divergence then its divergence is at least quadratic. We then formulate a computable combinatorial invariant, hypergraph index, for arbitrary Coxeter systems (W,S). This generalises Levcovitz's definition for the right-angled case. We prove that if (W,S) has finite hypergraph index h, then W is (strongly algebraically) thick of order at most h, hence has divergence bounded above by a polynomial of degree h+1. We conjecture that these upper bounds on the order of thickness and divergence are in fact equalities, and we prove our conjecture for certain families of Coxeter groups. These families are obtained by a new construction which, given any right-angled Coxeter group, produces infinitely many examples of non-right-angled Coxeter systems with the same hypergraph index. Finally, we give an upper bound on the hypergraph index of any Coxeter system (W,S), and hence on the divergence of W, in terms of, unexpectedly, the topology of its associated Dynkin diagram.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections