Square lattice self-avoiding walks and biased differential approximants

Abstract

The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions for the number of square lattice self-avoiding walks and some of their metric properties such as the mean-square end-to-end distance. The critical point $x_c$ for self-avoiding walks is known to a high degree of accuracy and we utilise this knowledge to undertake a new numerical analysis of the series using biased differential approximants. The new method is major advance in asymptotic power-series analysis in that it allows us to bias differential approximants to have a singularity of order $q$ at $x_c$. When biasing at $x_c$ with $q\ge 2$ the analysis yields a very accurate estimate for the critical exponent $\gamma =1.3437500(3)$ thus confirming the conjectured exact value $\gamma =43/32$ to 8 significant digits and removing a long-standing minor discrepancy between exact and numerical results. The analysis of the mean-square end-to-end distance yields $\nu =0.7500002(4)$ thus confirming the exact value $\nu =3/4$ to 7 significant digits.

14 pages, 3 figures

References in corpus (15)

• Algebraic Techniques for Enumerating Self-Avoiding Walks 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
• Exact Enumeration Study of Free Energies of Interacting Polygons and Walks in Two Dimensions
• Scaling function and universal amplitude combinations for self-avoiding polygons
• Two-dimensional self-avoiding walks and polymer adsorption: Critical fugacity estimates
• Exactly solved models of polyominoes and polygons
• The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is $1+\sqrt{2}$
• Pulling adsorbed self-avoiding walks from a surface
• On the growth constant for square-lattice self-avoiding walks
• q-linear approximants: Scaling functions for polygon models
• Three-dimensional terminally attached self-avoiding walks and bridges
• The perimeter generating function of punctured staircase polygons
• A new transfer-matrix algorithm for exact enumerations: self-avoiding walks on the square lattice
• A series test of the scaling limit of self-avoiding walks

Cited by in corpus (4)

• Exact enumeration of self-avoiding walks on BCC and FCC lattices
• Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
• On the existence of critical exponents for self-avoiding walks
• Three friendly walkers