 | ||
A golygon is any polygon with all right angles (a rectilinear polygon) whose sides are consecutive integer lengths. Golygons were invented and named by Lee Sallows, and popularized by A.K. Dewdney in a 1990 Scientific American column (Smith). Variations on the definition of golygons involve allowing edges to cross, using sequences of edge lengths other than the consecutive integers, and considering turn angles other than 90°.
In any golygon, all horizontal edges have the same parity as each other, as do all vertical edges. Therefore, the number n of sides must allow the solution of the system of equations
It follows from this that n must be a multiple of 8.
The number of golygons for a given permissible value of n may be computed efficiently using generating functions (sequence A007219 in the OEIS). The number of golygons for permissible values of n is 4, 112, 8432, 909288, etc. Finding the number of solutions that correspond to non-crossing golygons seems to be significantly more difficult.
There is a unique eight-sided golygon (shown in the figure); it can tile the plane by 180-degree rotation using the Conway criterion.
Generalizations
A serial-sided isogon of order n is a closed polygon with a constant angle at each vertex and having consecutive sides of length 1, 2, ..., n units. The polygon may be self-crossing. Golygons are a special case of serial-sided isogons.
The three-dimensional generalization of a golygon is called a golyhedron–a closed simply-connected solid figure confined to the faces of a cubical lattice and having face areas in the sequence 1, 2, ..., n, for some integer n. Golyhedrons have been found with values of n equal to 32, 15, 12, and 11 (the minimum possible).