Enumeration of symmetry classes of convex polyominoes in the square lattice

Details Enumeration of symmetry classes of convex polyominoes in the square lattice Enumeration of symmetry classes of convex polyominoes in the square lattice

1998-03-26

arxiv.org/abs/math/9803130v2

Advances in Applied Mathematics, 21 (1998), 343-380

Mathematics

Combinatorics

LaTeX 2e, 31 pages with 22 figures. Accepted in Advances in Applied Mathematics

Scientific paper

This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the groups C4, of rotations, and D4, of symmetries of the square acting on (translation- type) polyominoes. In virtue of Burnside's Lemma, it is sufficient to enumerate the various symmetry classes (fixed points) of polyominoes defined by the elements of C4 and D4. Using the Temperley--Bousquet-Melou methodology, we solve this problem and provide explicit or recursive formulas for their generating functions according to width, height and area. We also enumerate the class of asymmetric convex polyominoes, using Moebius inversion, and prove that their number is asymptotically equivalent to the number of convex polyominoes, a fact which is empirically evident.

Affiliated with

Also associated with

No associations

Rating

Enumeration of symmetry classes of convex polyominoes in the square lattice does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of symmetry classes of convex polyominoes in the square lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of symmetry classes of convex polyominoes in the square lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611722