![]() |
Discrete Mathematics & Theoretical Computer Science |
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.
Source : ScholeXplorer
IsRelatedTo ARXIV 1603.09589 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.jcta.2018.03.010 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1603.09589
|