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

二聚体、网络和簇可积系统

Dimers, networks, and cluster integrable systems

Anton Izosimov

摘要:

我们证明了由Goncharov和Kenyon在环面上的二聚体模型中构造的簇可积系统类与Gekhtman,Shapiro,Tabachnikov和Vainshtein使用Postnikov的完美网络定义的簇一致。为此,我们表示一个完美的网络的边界测量矩阵的相关的二部图的二聚体分拆函数的特征多项式。我们的主要工具是平面几何。也就是说,我们表明,如果一个完美的网络是这样一种方式,网络的边缘是欧氏测地线上画在一个平坦的环面,然后边缘之间的角度赋予相关的二部图与一个典型的分数Kasteleyn方向。然后使用该取向将分拆函数与边界测量相关联。

英文摘要:

We prove that the class of cluster integrable systems constructed by Goncharov and Kenyon out of the dimer model on a torus coincides with the one defined by Gekhtman, Shapiro, Tabachnikov, and Vainshtein using Postnikov's perfect networks. To that end we express the characteristic polynomial of a perfect network's boundary measurement matrix in terms of the dimer partition function of the associated bipartite graph. Our main tool is flat geometry. Namely, we show that if a perfect network is drawn on a flat torus in such a way that the edges of the network are Euclidian geodesics, then the angles between the edges endow the associated bipartite graph with a canonical fractional Kasteleyn orientation. That orientation is then used to relate the partition function to boundary measurements.

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

↑