arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.01726math.CO
收藏

Grassmann项链Le图的构造算法

An algorithm to construct the Le diagram associated to a Grassmann necklace

Susama Agarwala, Sian Fryer

摘要:

Le图和格拉斯曼项链都是非负格拉斯曼$Gr_{\geq 0}(k,n)$中的正素集合的索引,但它们擅长于非常不同的任务:例如,正素的维数很容易从它的Le图中提取,而正素的基的列表更容易从它的格拉斯曼项链中获得。因此,两者之间的显式双射是可取的。把Le图变成格拉斯曼项链的算法已经存在,在这篇笔记中,我们给出了相反的算法。

英文摘要:

Le diagrams and Grassmann necklaces both index the collection of positroids in the nonnegative Grassmannian $Gr_{\geq 0}(k,n)$, but they excel at very different tasks: for example, the dimension of a positroid is easily extracted from its Le diagram, while the list of bases of a positroid is far more easily obtained from its Grassmann necklace. Explicit bijections between the two are therefore desirable. An algorithm for turning a Le diagram into a Grassmann necklace already exists; in this note we give the reverse algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑