2000 character limit reached
Convex Polygons for Aperiodic Tiling (1602.06372v2)
Published 20 Feb 2016 in math.MG
Abstract: If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we prove that a convex polygon that can generate an edge-to-edge monohedral tiling must be able to generate a periodic tiling.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.