Old problem revisited: Which equilateral convex polygons tile the plane?
Bernhard Klaassen
TL;DR
This work leverages Rao's reported completeness of the 15 tiling pentagon types to provide a streamlined geometric characterization of all equilateral strictly convex plane tilings: any such tile must be a triangle or quadrangle, a pentagon with two inner angles summing to $\pi$ (or the special pentagon $P7$), or a hexagon with a triple of inner angles summing to $2\pi$ wherein two angles share an edge. The proof proceeds by constructing representative cases (notably $P8$ for type 8) and systematically excluding types 5 and 6, then verifying that only types 1, 2, 4, 7, 8 (and certain hexagons) satisfy the tiling criteria. The analysis also details possible symmetry groups for periodic tilings and discusses nonperiodic equilateral tilings with potential quasicrystal connections, while proposing the Delaney–Dress framework as an independent avenue for verification. Overall, the paper provides a concise, geometry-led consolidation of the equilateral tiling landscape under the assumption of Rao’s result, highlighting both classical and novel tiling structures and their broader implications.
Abstract
We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness of the well-known list of fifteen pentagon types. Assuming the validity of Rao's result, we provide a concise and mainly geometric proof of a tiling theorem originally due to Hirschhorn and Hunt. Finally, a possible connection to quasicrystals is sketched.
