Self-avoiding polygons on the square lattice

Details Self-avoiding polygons on the square lattice Self-avoiding polygons on the square lattice

1999-05-19

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

Physics

Condensed Matter

Statistical Mechanics

13 pages, 4 figures

Scientific paper

10.1088/0305-4470/32/26/305

We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective constant $\mu =2.63815852927(1)$ (biased) and the critical exponent $\alpha = 0.5000005(10)$ (unbiased). The critical point is indistinguishable from a root of the polynomial $581x^4 + 7x^2 - 13 =0.$ An asymptotic expansion for the coefficients is given for all $n.$ There is strong evidence for the absence of any non-analytic correction-to-scaling exponent.

Affiliated with

Also associated with

No associations

Rating

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 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 Self-avoiding polygons on the square lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-547059