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

Abstract

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.

References in corpus (3)

• Field theory of compact polymers on the square lattice
• Secondary Structures in Long Compact Polymers
• Self-avoiding walks crossing a square

Cited by in corpus (9)

• Skyrmion fluid and bimeron glass protected by a chiral spin liquid on a kagome lattice
• Unbiased sampling of globular lattice proteins in three dimensions
• Hard hexagon partition function for complex fugacity
• Semi-flexible compact polymers in two dimensional nonhomogeneous confinement
• Integrability vs non-integrability: Hard hexagons and hard squares compared
• A model of compact polymers on a family of three-dimensional fractal lattices
• Hamiltonian Cycles on Ammann-Beenker Tilings
• Fractal Path Strategies for Efficient 2D DMRG Simulations
• Enumeration of Hamiltonian Cycles on a Thick Grid Cylinder -- Part II: Contractible Hamiltonian Cycles