The numbers of line-defect self-avoiding polygons and related subgraphs of the square lattice
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 → ∞.
Year of publication: |
1994
|
---|---|
Authors: | Moraal, Hendrik |
Published in: |
Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 203.1994, 1, p. 103-113
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Symmetries of spin models on bipartite lattices
Moraal, Hendrik, (2001)
-
Multispin interactions for multistate spin models
Moraal, Hendrik, (2000)
-
Influence of the boundary on the connective constant of branching structures
Moraal, Hendrik, (1994)
- More ...