Macdonald polynomials as characters of Cherednik algebra modules
Representation Theory
2012-09-12 v2 Combinatorics
Abstract
We prove that Macdonald polynomials are characters of irreducible Cherednik algebra modules.
Keywords
Cite
@article{arxiv.1205.0593,
title = {Macdonald polynomials as characters of Cherednik algebra modules},
author = {Stephen Griffeth},
journal= {arXiv preprint arXiv:1205.0593},
year = {2012}
}
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