一类着色问题的二聚体和费米子公式
Dimer and fermionic formulations of a class of colouring problems
摘要:
证明了一个简单的q度正则图的q边着色数Z可以从描述同一图上二聚体的函数推导出来,即二聚体生成函数或等价的连通二聚体关联函数的集合.利用这种关系的二聚体问题,我们推导出费米子表示Z的格拉斯曼积分与四次行动。表达式给出平面图和非平面图嵌入(无边交叉)的环面。我们讨论了精确的数值评价的格拉斯曼积分使用的算法由Creutz,并提出了一个应用程序的4-边着色问题的环形正方形晶格,比较结果的数值传输矩阵计算和以前的Bethe anomaly研究。我们还表明,对于正方形,蜂窝状,3-12,和一维晶格,已知的精确结果的渐近缩放Z的顶点数可以表示在一个统一的方式作为同一个功能的不同值。
英文摘要:
We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible from functions describing dimers on the same graph, viz. the dimer generating function or equivalently the set of connected dimer correlation functions. Using this relationship to the dimer problem, we derive fermionic representations for Z in terms of Grassmann integrals with quartic actions. Expressions are given for planar graphs and for nonplanar graphs embeddable (without edge crossings) on a torus. We discuss exact numerical evaluations of the Grassmann integrals using an algorithm by Creutz, and present an application to the 4-edge-colouring problem on toroidal square lattices, comparing the results to numerical transfer matrix calculations and a previous Bethe ansatz study. We also show that for the square, honeycomb, 3-12, and one-dimensional lattice, known exact results for the asymptotic scaling of Z with the number of vertices can be expressed in a unified way as different values of one and the same function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。