Key points are not available for this paper at this time.
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.
I. G. Enting (Mon,) studied this question.