An extension of the two-dimensional self-avoiding walk series on the square lattice

The authors have adapted the dimerization algorithm for enumerating self-avoiding walks to exploit the parallelism of the Connection Machine System. By this approach they have extended the series for the number of self-avoiding walks on the 2D square lattice by five terms. These data may permit more accurate estimates of critical properties.