Wreath Macdonald polynomials at q=t as characters of rational Cherednik algebras
Dario Mathi\"a, Ulrich Thiel

TL;DR
This paper extends the connection between Macdonald polynomials and rational Cherednik algebra characters from symmetric groups to wreath product groups, showing that their characters correspond to specialized wreath Macdonald polynomials.
Contribution
It generalizes Gordon's result to wreath product groups, establishing that their rational Cherednik algebra characters are given by wreath Macdonald polynomials at q=t.
Findings
Characters are given by specialized wreath Macdonald polynomials.
Generalization from symmetric groups to wreath product groups.
Provides a new link between algebraic characters and symmetric functions.
Abstract
Using the theory of Macdonald, Gordon showed that the graded characters of the simple modules for the restricted rational Cherednik algebra by Etingof and Ginzburg associated to the symmetric group are given by plethystically transformed Macdonald polynomials specialized at q=t. We generalize this to restricted rational Cherednik algebras of wreath product groups and prove that the corresponding characters are given by a specialization of the wreath Macdonald polynomials defined by Haiman.
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 · Advanced Topics in Algebra
