Poincar\'e polynomial for fully commutative elements in the symmetric group
Sadek AL Harbat, Corinne Blondel

TL;DR
This paper computes the Poincaré polynomial for fully commutative elements in the symmetric group, providing a closed-form generating function that captures their combinatorial structure.
Contribution
It derives an explicit formula for the generating function of fully commutative elements in the symmetric group, advancing understanding of their algebraic and combinatorial properties.
Findings
Derived a closed-form expression for a_n(q)
Established connections between fully commutative elements and Coxeter group structure
Enhanced enumeration techniques for Coxeter group elements
Abstract
Let be the set of fully commutative elements of the Coxeter group . Let We compute .
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 · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
