Billey, Sara, and Holroyd, Alexander and Young, Benjamin, - A bijective proof of Macdonald's reduced word formula

dmtcs:6412 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
A bijective proof of Macdonald's reduced word formula

Authors: Billey, Sara, and Holroyd, Alexander and Young, Benjamin,

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.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Submitted on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]


Share

Consultation statistics

This page has been seen 64 times.
This article's PDF has been downloaded 48 times.