网格路径矩阵和阶乘

IF 1 2区 数学 Q1 MATHEMATICS
Carolina Benedetti-Velásquez, Kolja Knauer
{"title":"网格路径矩阵和阶乘","authors":"Carolina Benedetti-Velásquez, Kolja Knauer","doi":"10.1007/s00493-024-00085-4","DOIUrl":null,"url":null,"abstract":"<p>We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as coefficients. Furthermore, we study full lattice path flag matroids and show that—contrary to arbitrary positroid flag matroids—they correspond to points in the nonnegative flag variety. At the basis of this result lies an identification of certain intervals of the strong Bruhat order with lattice path flag matroids. A recent conjecture of Mcalmon, Oh, and Xiang states a characterization of quotients of positroids. We use our results to prove this conjecture in the case of LPMs.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lattice Path Matroids and Quotients\",\"authors\":\"Carolina Benedetti-Velásquez, Kolja Knauer\",\"doi\":\"10.1007/s00493-024-00085-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as coefficients. Furthermore, we study full lattice path flag matroids and show that—contrary to arbitrary positroid flag matroids—they correspond to points in the nonnegative flag variety. At the basis of this result lies an identification of certain intervals of the strong Bruhat order with lattice path flag matroids. A recent conjecture of Mcalmon, Oh, and Xiang states a characterization of quotients of positroids. We use our results to prove this conjecture in the case of LPMs.</p>\",\"PeriodicalId\":50666,\"journal\":{\"name\":\"Combinatorica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00493-024-00085-4\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-024-00085-4","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

我们根据格子路径矩阵(LPM)的图来描述它们之间的商。通过这种描述,我们可以证明,用商数对 LPM 进行排序可以得到一个分级正集,它的秩多项式的系数是纳拉亚纳数。此外,我们还研究了全格路径旗状矩阵,并证明与任意正方体旗状矩阵相反,它们对应于非负旗变中的点。这一结果的基础是强布鲁特阶的某些区间与格状路径旗状矩阵的识别。麦卡蒙、吴和项最近的一个猜想指出了正交子的商的特征。我们用我们的结果证明了 LPM 的这一猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lattice Path Matroids and Quotients

We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as coefficients. Furthermore, we study full lattice path flag matroids and show that—contrary to arbitrary positroid flag matroids—they correspond to points in the nonnegative flag variety. At the basis of this result lies an identification of certain intervals of the strong Bruhat order with lattice path flag matroids. A recent conjecture of Mcalmon, Oh, and Xiang states a characterization of quotients of positroids. We use our results to prove this conjecture in the case of LPMs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Combinatorica
Combinatorica 数学-数学
CiteScore
1.90
自引率
0.00%
发文量
45
审稿时长
>12 weeks
期刊介绍: COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信