A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice

We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A detailed comparison with the previous best algorithm shows significant improvement in the running time of the algorithm. The new algorithm is used to extend the enumeration of polygons to length 130 from the previous record of 110.Comment: 17 pages, 8 figures, IoP style file

A numerical adaptation of SAW identities from the honeycomb to other 2D lattices

Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the existence of a parafermionic observable for self-avoiding walks on the honeycomb lattice. Despite the absence of a corresponding observable for SAW on the square and triangular lattices, we show that in the limit of large lattices, some of the consequences observed on the honeycomb lattice persist on other lattices. This permits the accurate estimation, though not an exact evaluation, of certain critical amplitudes, as well as critical points, for these lattices. For the honeycomb lattice an exact amplitude for loops is proved.Comment: 21 pages, 7 figures. Changes in v2: Improved numerical analysis, giving greater precision. Explanation of why we observe what we do. Extra reference

Self-avoiding walks and polygons on the triangular lattice

We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monomer from the end points. For self-avoiding polygons to length 58 we calculate series for the mean-square radius of gyration and the first 10 moments of the area. Analysis of the series yields accurate estimates for the connective constant of triangular self-avoiding walks, $\mu=4.150797226(26)$, and confirms to a high degree of accuracy several theoretical predictions for universal critical exponents and amplitude combinations.Comment: 24 pages, 6 figure

Comment on `Series expansions from the corner transfer matrix renormalization group method: the hard-squares model'

Earlier this year Chan extended the low-density series for the hard-squares partition function $\kappa(z)$ to 92 terms. Here we analyse this extended series focusing on the behaviour at the dominant singularity $z_d$ which lies on on the negative fugacity axis. We find that the series has a confluent singularity of order 2 at $z_d$ with exponents $\theta=0.83333(2)$ and $\theta'= 1.6676(3)$. We thus confirm that the exponent $\theta$ has the exact value $\frac56$ as observed by Dhar.Comment: 5 pages, 1 figure, IoP macros. Expanded second and final versio

Honeycomb lattice polygons and walks as a test of series analysis techniques

We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution for polygons. Analysis of the series yields accurate estimates for the connective constant, critical exponents and amplitudes of honeycomb self-avoiding walks and polygons. The results from the numerical analysis agree to a high degree of accuracy with theoretical predictions for these quantities.Comment: 16 pages, 9 figures, jpconf style files. Presented at the conference "Counting Complexity: An international workshop on statistical mechanics and combinatorics." In celebration of Prof. Tony Guttmann's 60th birthda

Perimeter Generating Functions For The Mean-Squared Radius Of Gyration Of Convex Polygons

We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent $\nu=1$.Comment: 8 pages, 1 figur

Osculating and neighbour-avoiding polygons on the square lattice

We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour vertices provided these are joined by the associated edge and thus form a sub-set of self-avoiding polygons. We use the finite lattice method to count the number of osculating polygons and neighbour-avoiding polygons on the square lattice. We also calculate their radius of gyration and the first area-weighted moment. Analysis of the series confirms exact predictions for the critical exponents and the universality of various amplitude combinations. For both cases we have found exact solutions for the number of convex and almost-convex polygons.Comment: 14 pages, 5 figure

Enumeration of self-avoiding walks on the square lattice

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$.Comment: 24 pages, 6 figure