Self-avoiding polygons on the square lattice

DOI10.1088/0305-4470/32/26/305MaRDI QIDQ4947646zbMATH OpenOpenAlexWikidataFDO

Authors I. Jensen, Anthony J Guttmann

Publication date 25 April 2000

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/9905291

zbMATH Keywords

algorithmasymptotic expansioncritical pointgenerating functionself-avoiding polygonssquare lattice

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

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.

Recommendations

• Self-avoiding walks and polygons on the triangular lattice
• Size and area of square lattice polygons
• Enumeration of self-avoiding walks on the square lattice
• Square lattice
• Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices

Cited in

(41)

• On asymptotic extrapolation
• Square lattice
• Critical phenomena and renormalization-group theory
• An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
• An upper bound on the number of self-avoiding polygons via joining
• On the number of hexagonal polyominoes
• On the area of square lattice polygons.
• Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
• Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers
• A Borel transform method for locating singularities of Taylor and Fourier series
• Self-averaging in random self-interacting polygons
• Self-testing algorithms for self-avoiding walks
• Scaling function and universal amplitude combinations for self-avoiding polygons
• Calculation of the connective constant for self-avoiding walks via the pivot algorithm
• On the growth constant for square-lattice self-avoiding walks
• Enumeration of self-avoiding walks on the square lattice
• Scaling prediction for self-avoiding polygons revisited
• Self-avoiding walks and polygons on the triangular lattice
• Two-sided prudent walks: a solvable non-directed model of polymer adsorption
• Exactly solved models
• The anisotropic generating function of self-avoiding polygons is not D-finite
• Exact enumerations
• Series analysis
• Monte Carlo Methods for Lattice Polygons
• Appendix: Series data and growth constant, amplitude and exponent estimates
• Self-avoiding rings on the triangular lattice
• Critical exponents for square lattice trails with a fixed number of vertices of degree 4
• Punctured polygons and polyominoes on the square lattice
• Polygons pulled from an adsorbing surface
• Self-avoiding trails with nearest-neighbour interactions on the square lattice
• Multicritical scaling in a lattice model of vesicles
• Squeezing knots
• The design of efficient dynamic programming and transfer matrix enumeration algorithms
• New pattern theorems for square lattice self-avoiding walks and self-avoiding polygons
• Non-invertible symmetries and RG flows in the two-dimensional \(O(n)\) loop model
• The enumeration of prudent polygons by area and its unusual asymptotics
• Weakly directed self-avoiding walks
• Series analysis of a Kosterlitz-Thouless transition: the 6-state planar Potts model
• On the generation of discrete figures with connectivity constraints
• Direct and indirect loop equations in lattice Yang-Mills theory
• Families of prudent self-avoiding walks

This page was built for publication: Self-avoiding polygons on the square lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4947646)