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.
Twists, Higher Dimer Covers, and Web Duality for Grassmannian Cluster Algebras
University of California, Riverside(加州大学河滨分校);University of Minnesota, Twin Cities(明尼苏达大学双城分校);University of California, Berkeley(加州大学伯克利分校);Johns Hopkins University(约翰斯·霍普金斯大学)
Towards the Continuous Limit of Cluster Integrable Systems
我们开始研究如何将二聚体模型和(0+1)维团簇可积系统之间的对应关系扩展到(1+1)维和(2+1)维连续可积场论,解决实现这一目标所必需的各种问题。我们首先从谱曲线、复曲面Calabi-Yau 3-folds的分辨和D3-brane探针上的Higgsing in dilemma理论的角度研究了如何粘接和分裂两个可积系统。我们确定了一个连续的参数控制组件之间的解耦,并提出了两个互补的方法来确定依赖于此参数的动态变量的可积系统。感兴趣的建设系统具有无限多的自由度,我们研究的组合学的可积系统建立了大量的基本组件,并引入一个玩具模型捕捉的重要功能,预计将出现在一个连续的重组集群可积系统。