A Combinatorial Formula for Macdonald Polynomials

Abstract

We prove a combinatorial formula for the Macdonald polynomial Hmu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of Hmu(x;q,t) in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger 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 Klambda,mu(q,t) in the case that mu is a partition with parts less than or equal to 2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…