Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula

DOI10.1073/pnas.0408497102zbMath1208.05149OpenAlexW2000240710WikidataQ33865225 ScholiaQ33865225MaRDI QIDQ5293352

Nicholas A. Loehr, James Haglund, Mark D. Haiman

Publication date: 30 June 2007

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.0408497102

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Related Items

Breakthroughs in the theory of Macdonald polynomials ⋮ Combinatorics of the two-species ASEP and Koornwinder moments ⋮ Transition matrices for symmetric and quasisymmetric Hall-Littlewood polynomials ⋮ A bijective proof of a factorization formula for specialized Macdonald polynomials ⋮ Quasisymmetric expansions of Schur-function plethysms ⋮ A probabilistic interpretation of the Macdonald polynomials ⋮ Parabolic Kazhdan-Lusztig polynomials for Hermitian symmetric pairs ⋮ From multiline queues to Macdonald polynomials via the exclusion process ⋮ From multiline queues to Macdonald polynomials via the exclusion process ⋮ Square $\boldsymbol {q,t}$-lattice paths and $\boldsymbol {\nabla (p_n)}$ ⋮ Cylindric rhombic tableaux and the two-species ASEP on a ring

Cites Work

• A recursion and a combinatorial formula for Jack polynomials
• Double affine Hecke algebras and Macdonald's conjectures
• A proof of the \(q,t\)-Catalan positivity conjecture
• Hilbert schemes, polygraphs and the Macdonald positivity conjecture
• A Proof of Some q-Analogues of Selberg’s Integral for $k=1$
• Ribbon tableaux, Hall–Littlewood functions, quantum affine algebras, and unipotent varieties
• A combinatorial model for the Macdonald polynomials