Combinatorial formulas for Macdonald and Hall-Littlewood polynomials
From MaRDI portal
Publication:3176597
zbMATH Open1391.05266arXiv0811.4152MaRDI QIDQ3176597FDOQ3176597
Authors: Cristian Lenart
Publication date: 23 July 2018
Abstract: A breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula follows naturally from the more general Ram-Yip formula, via compression. Then we extend this approach to the Hall-Littlewood polynomials of type C, which are specializations of the corresponding Macdonald polynomials at q=0. We note that no analog of the Haglund-Haiman-Loehr formula exists beyond type A, so our work is a first step towards finding such a formula.
Full work available at URL: https://arxiv.org/abs/0811.4152
Recommendations
- On combinatorial formulas for MacDonald polynomials
- Hall-Littlewood polynomials, alcove walks, and fillings of Young diagrams
- Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula
- Haglund-Haiman-Loehr type formulas for Hall-Littlewood polynomials of type B and C
- A combinatorial formula for Macdonald polynomials
Hall-Littlewood polynomialsMacdonald polynomialsalcove walksSchwer's formulaHaglund-Haiman-Loehr formulaRam-Yip formula
Cited In (9)
- A combinatorial formula for Macdonald polynomials
- A combinatorial formula for Macdonald polynomials
- A combinatorial formula for Macdonald cumulants
- Haglund-Haiman-Loehr type formulas for Hall-Littlewood polynomials of type B and C
- Hall-Littlewood polynomials, alcove walks, and fillings of Young diagrams
- A combinatorial formula for the Schur coefficients of the integral form of the Macdonald polynomials in the two column and certain hook cases
- Title not available (Why is that?)
- On combinatorial formulas for MacDonald polynomials
- Combinatorial theory of Macdonald polynomials I: Proof of Haglund's formula
This page was built for publication: Combinatorial formulas for Macdonald and Hall-Littlewood polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176597)