The University of Michigan Combinatorics Seminar
Winter 2005
March 11, 4:10-5:00, 3866 East Hall

A combinatorial formula for Macdonald polynomials

Mark Haiman

University of California at Berkeley


I'll explain recent joint work with Jim Haglund and Nick Loehr, in which we prove a a combinatorial formula for the Macdonald polynomial $\tilde{H}_{\mu }(x;q,t)$ which had been conjectured by Haglund. Such a combinatorial formula had been sought ever since Macdonald introduced his polynomials in 1988.

The new formula has various pleasant consequences, including the expansion of Macdonald polynomials in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, and a new proof (and more general version) of Knop and Sahi's combinatorial formula for Jack polynomials.

In general, our formula doesn't yet give a new proof of the positivity theorem for Macdonald polynomials, because it expresses them in terms of monomials, rather than Schur functions. However, it does yield a new combinatorial expression for the Schur function expansion when the partition $\mu $ has parts $\leq 2$, and there is hope to extend this result.