A bijective proof of Macdonald's reduced word formula
A bijective proof of Macdonald's reduced word formula
复制标题
麦克唐纳简化词公式的双射证明
DOI：
10.5802/alco.23
复制
发表时间：
2017
影响因子：
0.7
通讯作者：
Benjamin Young
中科院分区：
文献类型：
--
作者：
Sara C. Billey;A. Holroyd;Benjamin Young
国际观众
我们描述了一个双射证明麦克唐纳的减少字的身份使用白日梦和小碰撞算法。证明延伸到一个主要的专业化的身份由于福明和斯坦利。我们的双射工具也使我们能够解决一个问题所提出的福明和基里洛夫从1997年，使用工作的瓦克斯，勒纳特和塞拉诺-树桩。
International audience
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.