Home  

Random  

Nearby  



Log in  



Settings  



Donate  



About Wikipedia  

Disclaimers  



Wikipedia





Hexomino





Article  

Talk  



Language  

Watch  

Edit  





Ahexomino (or6-omino) is a polyomino of order 6; that is, a polygon in the plane made of 6 equal-sized squares connected edge to edge.[1] The name of this type of figure is formed with the prefix hex(a)-. When rotations and reflections are not considered to be distinct shapes, there are 35 different free hexominoes. When reflections are considered distinct, there are 60 one-sided hexominoes. When rotations are also considered distinct, there are 216 fixed hexominoes.[2][3]

The 35 free hexominoes

Symmetry

edit

The figure above shows all 35 possible free hexominoes, coloured according to their symmetry groups:

If reflections of a hexomino are considered distinct, as they are with one-sided hexominoes, then the first and fourth categories above would each double in size, resulting in an extra 25 hexominoes for a total of 60. If rotations are also considered distinct, then the hexominoes from the first category count eightfold, the ones from the next three categories count fourfold, and the ones from the last category count twice. This results in 20 × 8 + (6 + 2 + 5) × 4 + 2 × 2 = 216 fixed hexominoes.

Packing and tiling

edit

Each of the 35 hexominoes satisfies the Conway criterion; hence, every hexomino is capable of tiling the plane.[4]

Although a complete set of 35 hexominoes has a total of 210 squares, it is not possible to pack them into a rectangle. (Such an arrangement is possible with the 12 pentominoes, which can be packed into any of the rectangles 3 × 20, 4 × 15, 5 × 12 and 6 × 10.) A simple way to demonstrate that such a packing of hexominoes is not possible is via a parity argument. If the hexominoes are placed on a checkerboard pattern, then 11 of the hexominoes will cover an even number of black squares (either 2 white and 4 black or vice versa) and the other 24 hexominoes will cover an odd number of black squares (3 white and 3 black). Overall, an even number of black squares will be covered in any arrangement. However, any rectangle of 210 squares will have 105 black squares and 105 white squares, and therefore cannot be covered by the 35 hexominoes.

However, there are other simple figures of 210 squares that can be packed with the hexominoes. For example, a 15 × 15 square with a 3 × 5 rectangle removed from the centre has 210 squares. With checkerboard colouring, it has 106 white and 104 black squares (or vice versa), so parity does not prevent a packing, and a packing is indeed possible.[5] It is also possible for two sets of pieces to fit a rectangle of size 420, or for the set of 60 one-sided hexominoes (18 of which cover an even number of black squares) to fit a rectangle of size 360.[6]

Polyhedral nets for the cube

edit
 
All 11 unfoldings of the cube

Apolyhedral net for the cube is necessarily a hexomino, with 11 hexominoes (shown at right) actually being nets. They appear on the right, again coloured according to their symmetry groups.

A polyhedral net for the cube cannot contain the O-tetromino, nor the I-pentomino, the U-pentomino, or the V-pentomino.

References

edit
  1. ^ Golomb, Solomon W. (1994). Polyominoes (2nd ed.). Princeton, New Jersey: Princeton University Press. ISBN 0-691-02444-8.
  • ^ Weisstein, Eric W. "Hexomino". From MathWorld – A Wolfram Web Resource. Retrieved 2008-07-22.
  • ^ Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36: 191–203. doi:10.1016/0012-365X(81)90237-5.
  • ^ Rhoads, Glenn C. (2003). Planar Tilings and the Search for an Aperiodic Prototile. PhD dissertation, Rutgers University.
  • ^ Mathematische Basteleien: Hexominos (in English)
  • ^ Hexomino Constructions
  • edit

    Retrieved from "https://en.wikipedia.org/w/index.php?title=Hexomino&oldid=1223824298"
     



    Last edited on 14 May 2024, at 15:58  





    Languages

     


    Español
    Esperanto
    Français

    Italiano
    Latviešu

    Polski
    Português
    Română
    Русский


     

    Wikipedia


    This page was last edited on 14 May 2024, at 15:58 (UTC).

    Content is available under CC BY-SA 4.0 unless otherwise noted.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Terms of Use

    Desktop