arXiv Analytics

Sign in

arXiv:1205.0593 [math.RT]AbstractReferencesReviewsResources

Macdonald polynomials as characters of Cherednik algebra modules

Stephen Griffeth

Published 2012-05-03, updated 2012-09-11Version 2

We prove that Macdonald polynomials are characters of irreducible Cherednik algebra modules.

Comments: 6 pages; v2 logical content essentially the same, but main theorem is now explicitly an equivalence between the n! theorem and the character formula for irreducible H-modules
Categories: math.RT, math.CO
Subjects: 05E15, 05E05
Related articles: Most relevant | Search more
arXiv:1909.01111 [math.RT] (Published 2019-09-03)
Many zeros of many characters of GL(n,q)
arXiv:math/0005021 [math.RT] (Published 2000-05-02)
On Characters of Weyl Groups
arXiv:2307.05160 [math.RT] (Published 2023-07-11)
Characters of classical groups, Schur-type functions, and discrete splines