麦克唐纳简化词公式的双射证明

IF 0.7 4区数学

Discrete Mathematics and Theoretical Computer Science Pub Date : 2017-02-09 DOI:10.5802/ALCO.23

Sara C. Billey, A. Holroyd, Benjamin Young

{"title":"麦克唐纳简化词公式的双射证明","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":"1 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2017-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"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\":\"1 1\",\"pages\":\"\"},\"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}","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

摘要

国际观众我们使用管道梦和利特尔的碰撞算法描述了麦克唐纳简化词身份的双射证明。这一证明延伸到了福明和斯坦利对身份的主要专门化。我们的双射工具还允许我们使用Wachs、Lenart和Serrano-Stump的工作来解决Fomin和Kirillov从1997年提出的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A bijective proof of Macdonald's reduced word formula

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics and Theoretical Computer Science 数学-计算机：软件工程

自引率

14.30%

发文量

期刊介绍： 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.