A bijective proof of Macdonald's reduced word formula - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2020

A bijective proof of Macdonald's reduced word formula

Résumé

We describe a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. The proof extends to a principal specialization of the identity due to Fomin and Stanley. Our bijective tools also allow us to address a problem posed by Fomin and Kirillov from 1997, using work of Wachs, Lenart and Serrano- Stump.
Fichier principal
Vignette du fichier
final_153.pdf (645.68 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-02173737 , version 1 (04-07-2019)

Identifiants

Citer

Sara C Billey, Alexander Holroyd, Benjamin J. Young. A bijective proof of Macdonald's reduced word formula. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6412⟩. ⟨hal-02173737⟩
29 Consultations
475 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More