Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials

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 t...

Popoln opis

Bibliografske podrobnosti

Glavni avtor:	Cristian Lenart
Format:	Artigo
Jezik:	Inglês
Izdano:	Discrete Mathematics & Theoretical Computer Science 2009-01-01
Serija:	Discrete Mathematics & Theoretical Computer Science
Teme:	macdonald polynomials hall-littlewood polynomials haglund-haiman-loehr formula alcove walks ram-yip formula schwer's formula [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online dostop:	https://dmtcs.episciences.org/2695/pdf
Oznake:	Označite Brez oznak, prvi označite!