Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices

Abstract

We have analysed the recently extended series for the number of self-avoiding walks (SAWs) that cross an L × L 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 CL(1)∼λSL2+bL+c⋅Lg, 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 extended and then analysed series for SAWs spanning the square lattice and self-avoiding polygons (SAPs) crossing the square lattice. These are known to also grow as The sub-dominant term λ b is found to be the same as for SAWs crossing the square, while the exponent for spanning SAWs and for SAPs. We have also studied the analogous problems on the hexagonal lattice, and generated series for a number of geometries. In particular, we study SAWs and SAPs crossing rhomboidal, triangular and square domains on the hexagonal lattice, as well as SAWs spanning a rhombus. We estimate that the analogous growth constant so an even more precise estimate than found for the square lattice. We also give estimates of the sub-dominant terms.