{"title":"A bijective proof of Macdonald's reduced word formula","authors":"Sara C. Billey, A. Holroyd, Benjamin Young","doi":"10.5802/ALCO.23","DOIUrl":null,"url":null,"abstract":"International audience\n \n 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.\n","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2017-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.5802/ALCO.23","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
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.
期刊介绍：
DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network.
Sections of DMTCS
Analysis of Algorithms
Automata, Logic and Semantics
Combinatorics
Discrete Algorithms
Distributed Computing and Networking
Graph Theory.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
