eScholarship Repository eScholarship Repository California Digital Library
eScholarship > Postprints > Paper 1135
Search all papers
 

notify_envelope Notify me of new papers
via Email or RSS


Postprints


A combinatorial formula for Macdonald polynomials
J Haglund
Mark Haiman, University of California, Berkeley
N Loehr

  Download the Article (393 K, PDF file) - 2005 Tell a colleague about it.
Printing Tips: Select 'print as image' in the Acrobat print dialog if you have trouble printing.

ABSTRACT:
Abstract: We prove a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$ which had been conjectured by Haglund. Corollaries to our main theorem include the expansion of $\tilde{H}_{\mu }(x;q,t)$ in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schützenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new combinatorial rule for the Kostka-Macdonald coefficients $\tilde{K}_{\lambda \mu }(q,t)$ in the case that $\mu $ is a partition with parts $\leq 2$.

SUGGESTED CITATION:
J Haglund, Mark Haiman, and N Loehr, "A combinatorial formula for Macdonald polynomials" (2005). Journal of the American Mathematical Society. 18 (3), pp. 735-761. Postprint available free at: http://repositories.cdlib.org/postprints/1135

 
bar
Open Archives Initiative eScholarship is a service of the California Digital Library bepress