arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.05723math.CO
收藏

弱分离集的交换图

The Exchange Graphs of Weakly Separated Collections

Meena Jagadeesan

摘要:

弱分离集合出现在由非负格拉斯曼上的普吕克坐标导出的簇代数中。哦,Postnikov和Speyer研究了一般Grassmann项链$\mathcal{I}$上的弱分离集合,并证明了每个交换图的连通性。Oh和Speyer后来介绍了交换图的一个推广,我们称之为$\mathcal{C}$ -常数图。他们在最小的两种情况下描述了这些图。证明了交换图与一类$\mathcal{C}$ -常数图的同构。我们用它来扩展Oh和Speyer的表征这些图的最小的四种情况下,我们提出了一个猜想上界的极大序模这些图。此外,我们充分刻画了某些类的这些图的特殊情况下的循环和树。

英文摘要:

Weakly separated collections arise in the cluster algebra derived from the Plücker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$ and proved the connectivity of every exchange graph. Oh and Speyer later introduced a generalization of exchange graphs that we call $\mathcal{C}$-constant graphs. They characterized these graphs in the smallest two cases. We prove an isomorphism between exchange graphs and a certain class of $\mathcal{C}$-constant graphs. We use this to extend Oh and Speyer's characterization of these graphs to the smallest four cases, and we present a conjecture on a bound on the maximal order of these graphs. In addition, we fully characterize certain classes of these graphs in the special cases of cycles and trees.

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

↑