The numbers of line-defect self-avoiding polygons and related subgraphs of the square lattice

Hendrik Moraal

Physica A: Statistical Mechanics and its Applications, 1994, vol. 203, issue 1, 103-113

Abstract: Those self-avoiding polygons of the square lattice, which have a perimeter larger by 2D than the perimeter of their bounding rectangle and for which this is due to a “line defect”, are defined. Also, classes of “spiked” convex self-avoiding polygons are introduced. A large number of generating functions for these types of graphs can be calculated exactly. All imply an asymptotic behaviour for the number of such graphs with perimeter P as P2 2P for P → ∞.

Date: 1994
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378437194900345
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:203:y:1994:i:1:p:103-113

DOI: 10.1016/0378-4371(94)90034-5

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().