Combinatorial Formulas for Macdonald and Hall-Littlewood PolynomialsConference paper
Authors: Cristian Lenart 1
NULL
Cristian Lenart
- 1 Department of Mathematics and Statistics [Albany-USA]
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.
Volume: DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Section: Proceedings
Published on: January 1, 2009
Imported on: January 31, 2017
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Macdonald polynomials, Hall-Littlewood polynomials, Haglund-Haiman-Loehr formula, alcove walks, Ram-Yip formula, Schwer's formula
Funding:
Source : OpenAIRE Graph- Combinatorial Studies in Algebra, Geometry, and Topology; Funder: National Science Foundation; Code: 0701044