A bijective proof of Macdonald’s reduced word formula
Algebraic Combinatorics · 04.03.2019 · 2 (2) · 217-248
DOI: 10.5802/alco.23 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 04.03.2019. Verfasst von Sara C. Billey und 2 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 49 Literaturangaben.
Abstract (Originalsprache)
We give a bijective proof of Macdonald’s reduced word identity using pipe dreams and Little’s bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our bijective tools also allow us to solve a problem posed by Fomin and Kirillov from 1997 using work of Wachs, Lenart, Serrano and Stump. These results extend earlier work by the third author on a Markov process for reduced words of the longest permutation.
Zitieren
APA
Billey, S. C., Holroyd, A. E., & Young, B. J. (2019). A bijective proof of Macdonald’s reduced word formula. Algebraic Combinatorics, 2(2), 217-248. https://doi.org/10.5802/alco.23
Vancouver
Billey SC, Holroyd AE, Young BJ. A bijective proof of Macdonald’s reduced word formula. Algebraic Combinatorics. 2019;2(2):217-248. doi:10.5802/alco.23
BibTeX
@article{Billey2019,
author = {Billey, Sara C. and Holroyd, Alexander E. and Young, Benjamin J.},
title = {A bijective proof of Macdonald’s reduced word formula},
journal = {Algebraic Combinatorics},
year = {2019},
volume = {2},
number = {2},
pages = {217--248},
doi = {10.5802/alco.23}
}
EUVIMED