Punctured polygons and polyominoes on the square lattice
arXiv:cond-mat/0003441 · doi:10.1088/0305-4470/33/9/303
Abstract
We use the finite lattice method to count the number of punctured staircase and self-avoiding polygons with up to three holes on the square lattice. New or radically extended series have been derived for both the perimeter and area generating functions. We show that the critical point is unchanged by a finite number of punctures, and that the critical exponent increases by a fixed amount for each puncture. The increase is 1.5 per puncture when enumerating by perimeter and 1.0 when enumerating by area. A refined estimate of the connective constant for polygons by area is given. A similar set of results is obtained for finitely punctured polyominoes. The exponent increase is proved to be 1.0 per puncture for polyominoes.
36 pages, 11 figures
References in corpus (1)
Cited by in corpus (5)
- Statistics of lattice animals (polyominoes) and polygons
- The perimeter generating function of punctured staircase polygons
- Exact perimeter generating function for a model of punctured staircase polygons
- The perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons
- Enumeration of planar Tangles