Self-avoiding walk enumeration via the lace expansion

Nathan Clisby, Richard Liang, and Gordon Slade

This website is an addendum to N. Clisby, R. Liang, G. Slade, Self-avoiding walk enumeration via the lace expansion, J. Phys. A: Math. Theor. 40:10973--11017, (2007), where we provide a method for enumeration of self-avoiding walks via enumeration of self-avoiding polygons and other so-called lace graphs. The Brydges-Spencer lace expansion gives a recurrence relation which expresses the number of self-avoiding walks in terms of the numbers of these lace graphs.

Here, we provide for download complete lists of our enumeration results of the number of self-avoiding walks and self-avoiding polygons, as well as the sum of squared displacements of self-avoiding walks, on the integer lattice Zd in dimensions 2 through 12. We also provide lists of our enumerations of restricted lace diagrams π(N)m,δ, which, given π(N)m,δ for all δ less than dimension d, are sufficient to calculate the lace expansion coefficients π(N)m, and therefore the coefficients πm, for dimension d.

References below to Section and Equation numbers refer to the above paper.

We list enumerations of the following quantities:

For the 2-dimensional square lattice, the entries below for cn, pn, and ρn link to the webpage of Iwan Jensen, who has obtained the most extensive enumerations of these quantities. We have used his enumerations of cn to calculate πn up to n=71 via Equation (16).

The numbers provided below are in plain text files intended to be easily machine-readable, at the expense of human-readability. Column entries are separated by a single tab character, and rows are separated by newlines. Readers who wish to print or otherwise read the data themselves may prefer to consult N. Clisby, R. Liang, G. Slade, Self-avoiding walk enumeration via the lace expansion: tables (Unpublished, 2007).

Self-avoiding walk and lace graph enumerations





θn and Rn

d=2 d=2 d=2 d=2 d=2
d=3 d=3 d=3 d=3 d=3
d=4 d=4 d=4 d=4 d=4
d=5 d=5 d=5 d=5 d=5
d=6 d=6 d=6 d=6 d=6
d=7 d=7 d=7 d=7 d=7
d=8 d=8 d=8 d=8 d=8
d=9 d=9 d=9 d=9 d=9
d=10 d=10 d=10 d=10 d=10
d=11 d=11 d=11 d=11 d=11
d=12 d=12 d=12 d=12 d=12

Lace graph enumerations with fixed number of loops: π(N)m,δ

Summed square displacements of lace graphs with fixed number of loops: r(N)m,δ

Coefficients in expansions in powers of (2d)-n

Updated 2007-05-21 15:04