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

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

2011-11-25

arxiv.org/abs/1111.5877v1

Physics

Mathematical Physics

17 pages, 8 figures, IoP style files

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new transfer-matrix algorithm for exact enumerations: Self-avoiding polygons on the square lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-173415