2000 character limit reached
On monohedral tilings of a regular polygon (2109.14264v5)
Published 29 Sep 2021 in math.MG, math.CO, and math.GT
Abstract: A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa, L\'angi and V\'\i gh (Mediterr. J. Math. 17: article number 156, 2020) characterized the monohedral tilings of a circular disc by three topological discs. The aim of this note is to connect these two results by characterizing the monohedral tilings of any regular $n$-gon with at most three tiles for any $n \geq 5$.
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.