Advanced search

Research, Computer Science

Exhaustive search of convex pentagons which tile the plane

Publication on Arxiv.org

Published on : August 29, 2017

In collaboration with the LIP (Computer Science Laboratory)

Pavages_Rao.jpg
Tilings 1 to 19. The arrow is from vertex s1 to s2 in the bold tile. © Michaël Rao

Abstract

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


Useful links

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)

Search of an article

Search of an article

Contact

ENS de Lyon
15 parvis René Descartes - BP 7000
69342 Lyon Cedex 07 - FRANCE
Descartes Campus : +33 (0) 4 37 37 60 00
Monod Campus : +33 (0) 4 72 72 80 00

Contact us

Stay connected