A bijective proof of a factorization formula for Macdonald polynomials at roots of unity

MaRDI QIDQ4584059zbMATH OpenFDO

Authors François Descouens, Hideaki Morita, Yasuhide Numata

Publication date 29 August 2018

Full work available at URL https://arxiv.org/abs/0803.2311, http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAJ0141

zbMATH Keywords

Macdonald polynomialsroots of unity

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Basic orthogonal polynomials and functions associated with root systems (Macdonald polynomials, etc.) (33D52)

Abstract: We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We mainly use the combinatorial interpretation of Haglund, Haiman and Loehr giving the expansion of the modified Macdonald polynomials on the monomial basis.

Recommendations

• On a bijective proof of a factorization formula for Macdonald polynomials
• A bijective proof of a factorization formula for specialized Macdonald polynomials
• Bijective proofs of the identities on the values of inner products of the Macdonald polynomials
• Factorizations of Pieri rules for Macdonald polynomials
• Factorization formulas for Macdonald polynomials
• scientific article; zbMATH DE number 1303516
• Factorizations of symmetric Macdonald polynomials
• A Unified Approach to Macdonald’s Root-System Conjectures
• Strong factorization property of Macdonald polynomials and higher-order Macdonald's positivity conjecture
• A representation-theoretic proof of the branching rule for Macdonald polynomials

Cited in

(5)

• A bijective proof of a factorization formula for specialized Macdonald polynomials
• A representation-theoretic proof of the branching rule for Macdonald polynomial
• On a bijective proof of a factorization formula for Macdonald polynomials
• A representation-theoretic proof of the branching rule for Macdonald polynomials
• A bijective proof of Macdonald's reduced word formula

This page was built for publication: A bijective proof of a factorization formula for Macdonald polynomials at roots of unity

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