Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
Anthony J Guttmann, Iwan Jensen

TL;DR
This paper refines estimates for the growth constants of self-avoiding walks and polygons crossing various domains on square and hexagonal lattices, introduces an efficient enumeration algorithm, and analyzes sub-dominant behaviors.
Contribution
It provides highly precise estimates of growth constants for SAWs and SAPs crossing domains on square and hexagonal lattices, and develops an efficient enumeration algorithm using minimal perfect hash functions.
Findings
Estimated growth constant for square lattice: 1.7445498 ± 0.0000012.
Estimated growth constant for hexagonal lattice: 1.38724951 ± 0.00000005.
Developed an efficient enumeration algorithm for lattice paths.
Abstract
We have analysed the recently extended series for the number of self-avoiding walks (SAWs) that cross an square between diagonally opposed corners. The number of such walks is known to grow as We have made more precise the estimate of based on additional series coefficients provided by several authors, and refined analysis techniques. We estimate that We have also studied the subdominant behaviour, and conjecture that where and We implemented a very efficient algorithm for enumerating paths on the square and hexagonal lattices making use of a minimal perfect hash function and in-place memory updating of the arrays for the counts of the number of paths. Using this algorithm we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Quasicrystal Structures and Properties · Geometric and Algebraic Topology
