A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice

Details A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice

2003-01-24

arxiv.org/abs/cond-mat/0301468v1

Physics

Condensed Matter

Statistical Mechanics

17 pages, 5 figures

Scientific paper

10.1088/0305-4470/36/21/304

We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of gyration to 100. Analysis of the resulting series yields very accurate estimates of the connective constant $\mu =2.63815853031(3)$ (biased) and the critical exponent $\alpha = 0.5000001(2)$ (unbiased). In addition we obtain very accurate estimates for the leading amplitudes confirming to a high degree of accuracy various predictions for universal amplitude combinations.

Affiliated with

Also associated with

No associations

Rating

A parallel algorithm for the enumeration of 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 parallel algorithm for the enumeration of 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 parallel algorithm for the enumeration of self-avoiding polygons on the square lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709473