A heptomino (or 7-omino or septomino) is a polyomino of order 7; that is, a polygon in the plane made of 7 equal-sized squares connected edge to edge.[1] The name of this type of figure is formed with the prefix hept(a)-. When rotations and reflections are not considered to be distinct shapes, there are 108 different free heptominoes. When reflections are considered distinct, there are 196 one-sided heptominoes. When rotations are also considered distinct, there are 760 fixed heptominoes.[2][3]
Symmetry
editThe figure shows all possible free heptominoes, coloured according to their symmetry groups:
- 84 heptominoes (coloured grey) have no symmetry. Their symmetry group consists only of the identity mapping.
- 9 heptominoes (coloured red) have an axis of reflection symmetry aligned with the gridlines. Their symmetry group has two elements, the identity and the reflection in a line parallel to the sides of the squares.
- 7 heptominoes (coloured green) have an axis of reflection symmetry at 45° to the gridlines. Their symmetry group has two elements, the identity and a diagonal reflection.
- 4 heptominoes (coloured blue) have point symmetry, also known as rotational symmetry of order 2. Their symmetry group has two elements, the identity and the 180° rotation.
- 3 heptominoes (coloured purple) have two axes of reflection symmetry, both aligned with the gridlines. Their symmetry group has four elements, the identity, two reflections and the 180° rotation. It is the dihedral group of order 2, also known as the Klein four-group.
- 1 heptomino (coloured orange) has two axes of reflection symmetry, both aligned with the diagonals. Its symmetry group also has four elements. Its symmetry group is also the dihedral group of order 2 with four elements.
If reflections of a heptomino are considered distinct, as they are with one-sided heptominoes, then the first and fourth categories above would each double in size, resulting in an extra 88 heptominoes for a total of 196. If rotations are also considered distinct, then the heptominoes from the first category count eightfold, the ones from the next three categories count fourfold, and the ones from the last two categories count twice. This results in 84 × 8 + (9+7+4) × 4 + (3+1) × 2 = 760 fixed heptominoes.
Packing and tiling
editOf the 108 free heptominoes, 101 satisfy the Conway criterion and 3 more can form a patch satisfying the criterion. Thus, only 4 heptominoes fail to satisfy the criterion and, in fact, these 4 are unable to tessellate the plane.[4]
The four heptominoes incapable of tiling a plane, including the one heptomino with a hole
Although a complete set of the 108 free heptominoes has a total of 756 squares, it is not possible to tile a rectangle with that set. The proof of this is trivial, since there is one heptomino which has a hole.[5] It is also impossible to pack them into a 757-square rectangle with a one-square hole because 757 is a prime number.
However, the set of 107 simply connected free heptominoes—that is, the ones without the hole—can tile a 7 by 107 (749-square) rectangle.[6] Furthermore, the complete set of free heptominoes can tile three 11-by-23 (253-square) rectangles, each with a one-square hole in the center; the complete set can also tile twelve 8 by 8 (64-square) squares with a one-square hole in the "center".[7]
References
edit- ^ Golomb, Solomon W. (1994). Polyominoes (2nd ed.). Princeton, New Jersey: Princeton University Press. ISBN 0-691-02444-8.
- ^ Weisstein, Eric W. "Heptomino". From MathWorld – A Wolfram Web Resource. Retrieved 2008-07-22.
- ^ Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5.
- ^ Rhoads, Glenn C. (2005). "Planar tilings by polyominoes, polyhexes, and polyiamonds". Journal of Computational and Applied Mathematics. 174 (2): 329–353. doi:10.1016/j.cam.2004.05.002.
- ^ Grünbaum, Branko; Shephard, G. C. (1987). Tilings and Patterns. New York: W. H. Freeman and Company. ISBN 0-7167-1193-1.
- ^ "Polyominoes: Even more heptominoes!"
- ^ Image, "An incredible heptomino solution by Patrick Hamlyn", from Material added Feb-Aug 2001 at MathPuzzzle.com
