A bijective proof of Macdonald's reduced word formula
arXiv: Combinatorics, 2017.
Abstract:
We give a bijective proof of Macdonaldu0027s reduced word identity using pipe dreams and Littleu0027s 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...More
Code:
Data:
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.
3.10 coins will be exchanged for 1 yuan.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 280 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1200 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 3000 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 7000 coins
Wechat's Red Packet
Tags
Comments