Enumeration of self-avoiding walks on the square lattice

Abstract

We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points have been derived to length 59. Analysis of the resulting series yields accurate estimates of the critical exponents $\gamma$ and $\nu$ confirming predictions of their exact values. Likewise we obtain accurate amplitude estimates yielding precise values for certain universal amplitude combinations. Finally we report on an analysis giving compelling evidence that the leading non-analytic correction-to-scaling exponent ${\Delta }_1=3/2$.

24 pages, 6 figures

References in corpus (6)

• Self-avoiding polygons on the square lattice
• A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice
• Algebraic Techniques for Enumerating Self-Avoiding Walks on the Square Lattice
• Universal Amplitude Combinations for Self-Avoiding Walks, Polygons and Trails
• Scaling function and universal amplitude combinations for self-avoiding polygons
• Size and area of square lattice polygons

Cited by in corpus (29)

• Exact enumeration of self-avoiding walks
• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• Polymer Physics by Quantum Computing
• Scale-free Monte Carlo method for calculating the critical exponent $\gamma$ of self-avoiding walks
• Exact partition function zeros and the collapse transition of a two-dimensional lattice polymer
• Self-avoiding walks and polygons on the triangular lattice
• Light propagation in a Cole-Cole nonlinear medium via Burgers-Hopf equation
• Two-dimensional self-avoiding walks and polymer adsorption: Critical fugacity estimates
• Spatial mixing and approximation algorithms for graphs with bounded connective constant
• Compressed self-avoiding walks, bridges and polygons
• Pulling adsorbed self-avoiding walks from a surface
• Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
• Parallel Algorithm for Calculation of the Exact Partition Function of a Lattice Polymer
• Honeycomb lattice polygons and walks as a test of series analysis techniques
• SAWdoubler: a program for counting self-avoiding walks
• Critical Loop Gases and the Worm Algorithm
• Elastic Lattice Polymers
• Scaling Analysis of Random Walks with Persistence Lengths: Application to Self-Avoiding Walks
• Non-intersection exponents of fully packed trails on the square lattice
• Pressure exerted by a grafted polymer on the limiting line of a semi-infinite square lattice
• Endless self-avoiding walks
• A numerical adaptation of SAW identities from the honeycomb to other 2D lattices
• Partition and generating function zeros in adsorbing self-avoiding walks
• Two-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponents
• Self-avoiding walks contained within a square
• Monte Carlo Simulation of Long Hard-Sphere Polymer Chains in Two to Five Dimensions
• Multicanonical simulation of the Domb-Joyce model and the Go model: new enumeration methods for self-avoiding walks
• Structural characterization of ice polymorphs from self-avoiding walks
• How to estimate the number of self-avoiding walks over 10^100? Use random walks