Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2009

Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials

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.
Fichier principal
Vignette du fichier
dmAK0146.pdf (249.7 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185387 , version 1 (20-08-2015)

Identifiers

Cite

Cristian Lenart. Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.549-560, ⟨10.46298/dmtcs.2695⟩. ⟨hal-01185387⟩

Collections

TDS-MACS
84 View
752 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More