Macdonald polynomials as characters of Cherednik algebra modules
Stephen Griffeth

TL;DR
This paper demonstrates that Macdonald polynomials can be interpreted as characters of irreducible modules over Cherednik algebras, establishing a deep algebraic connection.
Contribution
It provides a proof that Macdonald polynomials are characters of irreducible Cherednik algebra modules, linking special functions with algebraic representations.
Findings
Macdonald polynomials are characters of Cherednik algebra modules
Establishes a new algebraic interpretation of Macdonald polynomials
Connects symmetric functions with representation theory
Abstract
We prove that Macdonald polynomials are characters of irreducible Cherednik algebra modules.
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 Topics in Algebra · Advanced Combinatorial Mathematics
