Nonomino

A nonomino (or 9-omino) is a polyomino of order 9, that is, a polygon in the plane made of 9 equal-sized squares connected edge-to-edge.[1] The name of this type of figure is formed with the prefix non(a)-. When rotations and reflections are not considered to be distinct shapes, there are 1,285 different free nonominoes. When reflections are considered distinct, there are 2,500 one-sided nonominoes. When rotations are also considered distinct, there are 9,910 fixed nonominoes.[2]

A nonomino or Jigsaw Sudoku puzzle, as seen in the Sunday Telegraph

Symmetry

The 1,285 free nonominoes can be classified according to their symmetry groups:[2]

  • 1,196 nonominoes have no symmetry. Their symmetry group consists only of the identity mapping.
  • 38 nonominoes 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.

  • 26 nonominoes have an axis of reflection symmetry at 45° to the gridlines. Their symmetry group has two elements, the identity and a diagonal reflection.

  • 19 nonominoes have point symmetry, also known as rotational symmetry of order 2. Their symmetry group has two elements, the identity and the 180° rotation.

  • 4 nonominoes 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.

  • 2 nonominoes have four axes of reflection symmetry, aligned with the gridlines and the diagonals, and rotational symmetry of order 4. Their symmetry group, the dihedral group of order 4, has eight elements.

Unlike octominoes, there are no nonominoes with rotational symmetry of order 4 or with two axes of reflection symmetry aligned with the diagonals.

If reflections of a nonomino are considered distinct, as they are with one-sided nonominoes, then the first and fourth categories above double in size, resulting in an extra 1,215 nonominoes for a total of 2,500. If rotations are also considered distinct, then the nonominoes from the first category count eightfold, the ones from the next three categories count fourfold, the ones from the fifth category count twice, and the ones from the last category count only once. This results in 1,196 × 8 + (38+26+19) × 4 + 4 × 2 + 2 = 9,910 fixed nonominoes.

Packing and tiling

37 nonominoes have holes.[3][4] Therefore a complete set cannot be packed into a rectangle and not all nonominoes have tilings. Of the 1285 free nonominoes, 960 satisfy the Conway criterion and 88 more can form a patch satisfying the criterion. However, 1050 (not 1048) free nonominoes do admit tilings,[5] the two exceptions shown to the right. This is the lowest order of polyomino for which such exceptions exist.[6]

One nonomino has a two-square hole (second rightmost in the top row) and is the smallest polyomino with such a hole.

gollark: That's very random, and it doesn't really *have* lore.
gollark: Presumably they can at least get a rough idea of where it *isn't*.
gollark: No, they had access to ||faster than light transport via a gate constructed by the protomolecule||, if I recall correctly.
gollark: (possibly wrong, from half-remembered plot summaries, may need to spoiler that)
gollark: Possibly misremembered possibly spoiler:: ||Isn't there actually a lot of colonization of other planets in the later books?||

References
  1. Golomb, Solomon W. (1994). Polyominoes (2nd ed.). Princeton, New Jersey: Princeton University Press. ISBN 0-691-02444-8.
  2. Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36: 191–203. doi:10.1016/0012-365X(81)90237-5.
  3. Weisstein, Eric W. "Polyomino". MathWorld.
  4. Sloane, N. J. A. (ed.). "Sequence A001419 (Number of n-celled polyominoes with holes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. Rawsthorne, Daniel A. (1988). "Tiling complexity of small n-ominoes (n<10)". Discrete Mathematics. 70: 71–75. doi:10.1016/0012-365X(88)90081-7.
  6. 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.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.