Osculating and neighbour-avoiding polygons on the square lattice

Details Osculating and neighbour-avoiding polygons on the square lattice Osculating and neighbour-avoiding polygons on the square lattice

2001-09-07

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

Physics

Condensed Matter

Statistical Mechanics

14 pages, 5 figures

Scientific paper

10.1088/0305-4470/34/39/305

We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour vertices provided these are joined by the associated edge and thus form a sub-set of self-avoiding polygons. We use the finite lattice method to count the number of osculating polygons and neighbour-avoiding polygons on the square lattice. We also calculate their radius of gyration and the first area-weighted moment. Analysis of the series confirms exact predictions for the critical exponents and the universality of various amplitude combinations. For both cases we have found exact solutions for the number of convex and almost-convex polygons.

Affiliated with

Also associated with

No associations

Rating

Osculating and neighbour-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 Osculating and neighbour-avoiding polygons on the square lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Osculating and neighbour-avoiding polygons on the square lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-106806