Decomino

A decomino, or 10-omino, is a polyomino of order 10, that is, a polygon in the plane made of 10 equal-sized squares connected edge-to-edge.[1] When rotations and reflections are not considered to be distinct shapes, there are 4,655 different free decominoes (the free decominoes comprise 195 with holes and 4,460 without holes). When reflections are considered distinct, there are 9,189 one-sided decominoes. When rotations are also considered distinct, there are 36,446 fixed decominoes.[2]

Symmetry

The unique decomino with two axes of reflection symmetry, both aligned with the diagonals

The 4,655 free decominoes can be classified according to their symmetry groups:[2]

Unlike both octominoes and nonominoes, no decomino has rotational symmetry of order 4.

Packing and tiling

A self-tiling tile set consisting of decominoes

195 decominoes have holes. This makes it trivial to prove that the complete set of decominoes cannot be packed into a rectangle, and that not all decominoes can be tiled.

The 4,460 decominos without holes comprise 44,600 unit squares. Thus, the largest square that can be tiled with distinct decominoes is at most 210 units on a side (210 squared is 44,100). Such a square containing 4,410 decominoes was constructed by Livio Zucca.[3]

References

  1. Golomb, Solomon W. (1994). Polyominoes (2nd ed.). Princeton, New Jersey: Princeton University Press. ISBN 0-691-02444-8.
  2. 1 2 Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5.
  3. Iread.it: Maximal squares of polyominoes
This article is issued from Wikipedia - version of the 1/25/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.