The number of convex polygons on the square and honeycomb lattices
- 21 April 1988
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 21 (8) , L467-L474
- https://doi.org/10.1088/0305-4470/21/8/007
Abstract
A subset of the set of self-avoiding polygons (SAP) embeddable on the square lattice which display the property of convexity is defined. An algorithm for their enumeration is developed, and from the available series coefficients the exact generating function is found. The singularity structure appears similar to that of the unsolved SAP problem, but with different critical exponents and critical points. The enumeration of convex polygons allows the extension of the existing series for the square lattice SAP by one term. For the honeycomb lattice similar results have been obtained, despite a less natural definition of convexity.Keywords
This publication has 11 references indexed in Scilit:
- The size and number of rings on the square latticeJournal of Physics A: General Physics, 1988
- Number of anisotropic spiral self-avoiding loopsJournal of Physics A: General Physics, 1987
- Size of rings in two dimensionsJournal of Physics A: General Physics, 1985
- Self-avoiding polygons on the square, L and Manhattan latticesJournal of Physics A: General Physics, 1985
- Comment on the number of spiral self-avoiding walksJournal of Physics A: General Physics, 1984
- On the number of spiral self-avoiding walksJournal of Physics A: General Physics, 1984
- Generating functions for enumerating self-avoiding rings on the square latticeJournal of Physics A: General Physics, 1980
- Inhomogeneous differential approximants for power seriesJournal of Physics A: General Physics, 1979
- Methods of series analysis. III. Integral approximant methodsPhysical Review B, 1979
- On a new method of series analysis in lattice statisticsJournal of Physics A: General Physics, 1972