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.
No takes yet. Share an insight, caveat, or question.
I. G. Enting (1980) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: