Exhaustive search of convex pentagons which tile the plane

We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which allows only non-periodic tilings.
References : Exhaustive search of convex pentagons which tile the plane. MichaŽl Rao, Arxiv.org, arXiv:1708.00274

Exhaustive search of convex pentagons which tile the plane (publication on Arxiv.org)
MichaŽl Rao
LIP (Computer Science Laboratory)
Pentagon Tiling Proof Solves Century-Old Math Problem (article in Quanta Magazine)

This site uses cookies and analysis tools to improve the usability of the site. More information. |