On Combinatorial Formulas for Macdonald Polynomials
| dc.creator | Lenart, Cristian | |
| dc.date | 2008-04-30 | |
| dc.date.accessioned | 2026-07-07T09:35:59Z | |
| dc.date.available | 2026-07-07T09:35:59Z | |
| dc.description | A recent 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 a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, which is similar to the Haglund-Haiman-Loehr one but contains considerably fewer terms. | |
| dc.identifier | https://arxiv.org/abs/0804.4716 | |
| dc.identifier | http://arxiv.org/abs/0804.4716 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160017 | |
| dc.subject | Combinatorics | |
| dc.subject | Representation Theory | |
| dc.subject | 05E05; 33D52 | |
| dc.title | On Combinatorial Formulas for Macdonald Polynomials | |
| dc.type | text |