On the structure of multiple translational tilings by polygonal regions

Abstract

We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon K tiles the plane multiply when translated at the locations , where is a multiset in the plane. The pairing property of K makes this question particularly amenable to Fourier Analysis. After establishing a necessary and sufficient condition for K to tile with a given lattice (which was first found by Bolle for the case of convex polygons-notice that all convex polygons that tile, necessarily have the pairing property and, therefore, our theorems apply to them) we move on to prove that a large class of such polygons tiles only quasi-periodically, which for us means that must be a finite union of translated 2-dimensional lattices in the plane. For the particular case of convex polygons we show that all convex polygons which are not parallelograms tile necessarily quasi-periodically, if at all.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…