Recursions and divisibility properties for combinatorial MacDonald polynomials

MaRDI QIDQ5403053zbMATH OpenFDO

Authors Nicholas A. Loehr, Elizabeth Niese

Publication date 25 March 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1487/0.html

zbMATH Keywords

\(q\)-analoguesHilbert seriesrecursionsbijectionsGarsia-Haiman modulesMacDonald polynomials

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Basic orthogonal polynomials and functions associated with root systems (Macdonald polynomials, etc.) (33D52)

Recommendations

• A new recursion in the theory of Macdonald polynomials
• A new recursion for three-column combinatorial Macdonald polynomials
• A combinatorial model for the Macdonald polynomials
• Factorizations of Pieri rules for Macdonald polynomials
• Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula

Cited in

(5)

• Recursion and explicit formulas for particular \(N\)-variable Knop-Sahi and Macdonald polynomials
• A new recursion for three-column combinatorial Macdonald polynomials
• Factorizations of Pieri rules for Macdonald polynomials
• A bijective proof of a factorization formula for specialized Macdonald polynomials
• A new recursion in the theory of Macdonald polynomials

This page was built for publication: Recursions and divisibility properties for combinatorial MacDonald polynomials

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