A new recursion in the theory of Macdonald polynomials
From MaRDI portal
Publication:434227
DOI10.1007/s00026-011-0122-5zbMath1244.05229OpenAlexW2094266763MaRDI QIDQ434227
James Haglund, Adriano M. Garsia
Publication date: 10 July 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-011-0122-5
Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On certain graded \(S_ n\)-modules and the \(q\)-Kostka polynomials
- Lattice diagram polynomials and extended Pieri rules
- Tableau atoms and a new Macdonald positivity conjecture
- Factorizations of Pieri rules for Macdonald polynomials
- Some natural bigraded \(S_ n\)-modules and \(q,t\)-Kostka coefficients
- Hilbert schemes, polygraphs and the Macdonald positivity conjecture
- Some Particular Entries of the Two-Parameter Kostka Matrix
- A combinatorial formula for Macdonald polynomials
- A graded representation model for Macdonald's polynomials.
- A new class of symmetric functions
This page was built for publication: A new recursion in the theory of Macdonald polynomials