A new transfer-matrix algorithm for exact enumerations: self-avoiding walks on the square lattice

We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of self-avoiding walks on the square lattice. A detailed comparison with our previous best algorithm shows very significant improvement in the running time of the new algorithm. The new algorithm is used to extend the enumeration of self-avoiding walks to length 79 from the previous record of 71 and for metric properties, such as the average end-to-end distance, from 59 to 71.

No reviews yet.

No comments yet.