Self-avoiding polygons on the square lattice

Abstract

We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective constant $\mu =2.63815852927(1)$ (biased) and the critical exponent $\alpha =0.5000005(10)$ (unbiased). The critical point is indistinguishable from a root of the polynomial $581x^4+7x^2-13=0.$ An asymptotic expansion for the coefficients is given for all $n.$ There is strong evidence for the absence of any non-analytic correction-to-scaling exponent.

13 pages, 4 figures

Cited by in corpus (31)

• Statistics of lattice animals (polyominoes) and polygons
• Enumeration of self-avoiding walks on the square lattice
• A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice
• Correction-to-scaling exponents for two-dimensional self-avoiding walks
• A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice
• Scaling behaviour of two-dimensional polygon models
• Self-avoiding walks and polygons on the triangular lattice
• Scaling function and universal amplitude combinations for self-avoiding polygons
• Families of prudent self-avoiding walks
• Two-dimensional self-avoiding walks and polymer adsorption: Critical fugacity estimates
• Exact Scaling Functions for Self-Avoiding Loops and Branched Polymers
• Punctured polygons and polyominoes on the square lattice
• Scaling in DNA unzipping models: denaturated loops and end-segments as branches of a block copolymer network
• A Borel transform method for locating singularities of Taylor and Fourier series
• Size and area of square lattice polygons
• On the growth constant for square-lattice self-avoiding walks
• Honeycomb lattice polygons and walks as a test of series analysis techniques
• Corner transfer matrix renormalization group method for two-dimensional self-avoiding walks and other O(n) models
• Elastic Lattice Polymers
• Weakly directed self-avoiding walks
• Endless self-avoiding walks
• Exact generating function for 2-convex polygons
• Polygons pulled from an adsorbing surface
• Scaling prediction for self-avoiding polygons revisited
• A solvable non-directed model of polymer adsorption
• A numerical adaptation of SAW identities from the honeycomb to other 2D lattices
• The Enumeration of Prudent Polygons by Area and its Unusual Asymptotics
• Osculating and neighbour-avoiding polygons on the square lattice
• Perimeter Generating Functions For The Mean-Squared Radius Of Gyration Of Convex Polygons
• Efficiency of the Incomplete Enumeration algorithm for Monte-Carlo simulation of linear and branched polymers
• A parallel algorithm for the enumeration of benzenoid hydrocarbons