Pentagon-Decagon Packing

Pentagon-Decagon Packing - Greg Egan

Pentagon-Decagon Packing – Greg Egan

Two regular pentagons and a regular decagon meet snugly at a vertex: their interior angles sum to 360°. However, they can’t tile the plane. However, they come fairly close, as shown in this picture by Greg Egan.

Say we have three regular polygons with p,q, and r sides, respectively. Their interior angles will sum to 360° if and only if

1p+1q+1r=12

So, two regular pentagons and a regular decagon can meet snugly at a vertex because

15+15+110=12

In fact there are 10 solutions of the equation

1p+1q+1r=12

for natural numbers p,q, and r, not counting the order. Of these, only 4 give tilings of the plane by regular polygons. The other 6 are ‘forbidden’.

Here are all 10 solutions:

  1. 16+16+16=12
    gives the regular hexagonal tiling.
  2. 15+15+110=12
    does not give a tiling by regular polygons, but it gives the packing shown above, and three more described by Robert Fathauer.

    Regular Polygons Meeting at Vertex: 5.5.10
  3. 14+18+18=12
    gives the semiregular truncated square tiling.
  4. 14+16+112=12
    gives the semiregular truncated trihexagonal tiling.
  5. 14+15+120=12
    does not give a tiling by regular polygons, but it gives a packing described by Robert Fathauer.

    Regular Polygons Meeting at Vertex: 4.5.20
  6. 13+112+112=12
    gives the semiregular truncated hexagonal tiling.
  7. 13+110+115=12
    does not give a tiling by regular polygons, but it gives two packings described by Robert Fathauer and Kevin Jardine.

    Regular Polygons Meeting at Vertex: 3.10.15
  8. 13+19+118=12
    does not give a tiling by regular polygons, but it gives a packing described by Robert Fathauer.

    Regular Polygons Meeting at Vertex: 3.9.18
  9. 13+18+124=12
    does not give a tiling by regular polygons, but it gives two packings discovered by Robert Fathauer and Kevin Jardine.

    Regular Polygons Meeting at Vertex: 3.8.24
  10. 13+17+142=12
    does not give a tiling by regular polygons, but it gives a packing discovered by Robert Fathauer.

    Regular Polygons Meeting at Vertex: 3.7.42

Because 42 is the largest number appearing in the above list of solutions, this number—or twice this number—appears in Hurwitz’s automorphism theorem. This says that the number of orientation-preserving conformal transformations of a compact Riemann surface of genus g>1 is at most 84(g1). For more on this, see:

• John Baez, 42.

For more on the 6 ‘forbidden tilings’—the 6 solutions on the list above that do not give tilings of the plane by regular polygons—see this set of webpages:

• Kevin Jardine, Imperfect congruence: Kepler, Dürer and the mystery of the forbidden tilings.

Also see:

Tiling by regular polygons, Wikipedia.

The above pictures of the 6 forbidden tilings were created by dllu and placed on Wikimedia Commons under a Creative Commons CC0 1.0 Universal Public Domain Dedication copyright.