arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0709.2322cond-mat.stat-mech
收藏

二维和三维中哈密尔顿回路、行走和链的精确计数

Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions

Jesper Lykke Jacobsen

摘要:

本文提出了一个计算低维正则格上哈密尔顿链个数的算法。根据定义,这些是k个不相交路径的集合,它们的并集访问每个网格顶点恰好一次。著名的哈密尔顿回路和行走分别作为特殊情况k=0和k=1出现。在两个维度上,我们列举了L × L正方形格子上的链,L=12,行走L=17,电路L=20。文中还给出了三维情况下的一些结果。使用我们的数据,我们提取了几个物理量的兴趣。

英文摘要:

We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices in low dimensions. By definition, these are sets of k disjoint paths whose union visits each lattice vertex exactly once. The well-known Hamiltonian circuits and walks appear as the special cases k=0 and k=1 respectively. In two dimensions, we enumerate chains on L x L square lattices up to L=12, walks up to L=17, and circuits up to L=20. Some results for three dimensions are also given. Using our data we extract several quantities of physical interest.

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

↑