Counting nearest faraway flats for Coxeter chambers
Theo Douvropoulos

TL;DR
This paper provides a case-free enumeration formula for certain parabolic subgroups in finite Coxeter groups, linking geometric and combinatorial methods, and offers a new proof of Chapoton's reflection count formula.
Contribution
It introduces a case-free product formula for counting specific parabolic subgroups in Coxeter groups, combining geometric and combinatorial techniques.
Findings
Derived a case-free enumeration formula for parabolic subgroups.
Connected geometric interpretation with Crapo's beta invariant.
Provided the first case-free proof of Chapoton's reflection formula.
Abstract
In a finite Coxeter group and with two given conjugacy classes of parabolic subgroups and , we count those parabolic subgroups of in that are full support, while simultaneously being simple extensions (i.e., extensions by a single reflection) of some standard parabolic subgroup of in . The enumeration is given by a product formula that depends only on the two parabolic types. Our derivation is case-free and combines a geometric interpretation of the "full support" property with a double counting argument involving Crapo's beta invariant. As a corollary, this approach gives the first case-free proof of Chapoton's formula for the number of reflections of full support in a real reflection group .
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
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Algebraic structures and combinatorial models
