Enumeration of symmetry classes of convex polyominoes in the square lattice (Q1271866): Difference between revisions

This paper is concerned with enumerating convex polyominoes on the plane square lattice. This is done in terms of the orbits of the groups \({\mathfrak C}_4\) of rotations and \({\mathfrak D}_4\) of symmetries enumerating the symmetry classes defined by the elements of \({\mathfrak C}_4\) and \({\mathfrak D}_4\) as a result of Burnside's lemma. The class of completely asymmetric convex polyominoes is also enumerated using Möbius inversion and it is concluded that, as might be expected, a large convex polyomino is ``almost certain'' to be asymmetric. Reviewers note. The paper makes much use of the fact that convex polyominoes can be made by putting four Ferrers diagrams together.