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...
Main Author: | Cristian Lenart |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2009-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2695/pdf |
Similar Items
-
A bijective proof of a factorization formula for Macdonald polynomials at roots of unity
by: F. Descouens, et al.
Published: (2008-01-01) -
Macdonald polynomials at $t=q^k$
by: Jean-Gabriel Luque
Published: (2009-01-01) -
A kicking basis for the two column Garsia-Haiman modules
by: Sami Assaf, et al.
Published: (2009-01-01) -
Refinements of the Littlewood-Richardson rule
by: J. Haglund, et al.
Published: (2009-01-01) -
Hall-Littlewood Polynomials in terms of Yamanouchi words
by: Austin Roberts
Published: (2014-01-01)