Sara C. Billey, Alexander E. Holroyd, Benjamin Young
Published 2017-02-09Version 1
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.
Bijective Proofs of Gould's and Rothe's Identities
A bijective proof and generalization of Siladić's Theorem
A bijective proof of the Cauchy identity for Grothendieck polynomials
![QR code for arXiv:1702.02936 [math.CO]](http://oss.arxitics.com/images/favicon.svg)