Tiling Problem: Convex Pentagons for Edge-to-Edge Monohedral Tiling and Convex Polygons for Aperiodic Tiling
classification
🧮 math.MG
keywords
convexedge-to-edgetilingaperiodicmonohedralpentagonsclassifiedconditions
read the original abstract
We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile without matching conditions other than "edge-to-edge."
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.