Generating functions for enumerating self-avoiding rings on the square lattice
- 1 December 1980
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 13 (12) , 3713-3722
- https://doi.org/10.1088/0305-4470/13/12/021
Abstract
It is shown that generating function techniques provide an efficient means of enumerating the number of self-avoiding rings (polygons) on the square lattice. The techniques can be applied to a number of related problems in lattice statistics and statistical mechanics. The enumeration has been extended to polygons of up to 38 steps.Keywords
This publication has 13 references indexed in Scilit:
- The square lattice Ising model with a free surfaceJournal of Physics A: General Physics, 1980
- The limit of chromatic polynomialsJournal of Combinatorial Theory, Series B, 1979
- Generalised Mobius functions for rectangles on the square latticeJournal of Physics A: General Physics, 1978
- Connections between Ising Models and Various Probability DistributionsAdvances in Applied Probability, 1978
- Configurational studies of the Potts modelsJournal of Physics A: Mathematical, Nuclear and General, 1974
- Weighting of graphs for the Ising and classical vector modelsJournal of Physics C: Solid State Physics, 1972
- Exponents for the excluded volume problem as derived by the Wilson methodPhysics Letters A, 1972
- The Description of a Random Field by Means of Conditional Probabilities and Conditions of Its RegularityTheory of Probability and Its Applications, 1968
- Probability of Initial Ring Closure in the Restricted Random-Walk Model of a MacromoleculeThe Journal of Chemical Physics, 1961
- Percolation processesMathematical Proceedings of the Cambridge Philosophical Society, 1957