A new recursion for three-column combinatorial Macdonald polynomials

DOI10.1016/J.JCTA.2012.07.008MaRDI QIDQ1758509zbMATH OpenOpenAlexFDO

Authors Elizabeth Niese

Publication date 9 November 2012

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2012.07.008

zbMATH Keywords

symmetric functionstableauxMacdonald polynomials

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Recommendations

• A new recursion in the theory of Macdonald polynomials
• Recursions and divisibility properties for combinatorial MacDonald polynomials
• A combinatorial formula for the Hilbert series of bigraded \(S_{n}\)-modules
• Combinatorial formula for the Hilbert series of bigraded \(S_{n}\)-modules
• Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula

Cited in

(4)

• A combinatorial formula for the Hilbert series of bigraded \(S_{n}\)-modules
• Combinatorial formula for the Hilbert series of bigraded \(S_{n}\)-modules
• A new recursion in the theory of Macdonald polynomials
• Recursions and divisibility properties for combinatorial MacDonald polynomials

This page was built for publication: A new recursion for three-column combinatorial Macdonald polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758509)