2018/09/10 by Bochen Liu, Liu, Bochen · 1 citation
Computer Science · Engineering · Materials Science · Mathematics · #Cellular Automata and Applications #Classical Analysis and ODEs (math.CA) #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #Number Theory (math.NT) #Quasicrystal Structures and Properties #graph theory and CDMA systems #math.CA #math.CO #math.MG #math.NT
paper · pdf · doi:10.48550/arxiv.1809.03440
Final version, to appear in Amer. J. Math
openalex publication_date 2018/09/10 · arxiv created 2019/10/22 · arxiv updated 2019/10/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Suppose f∈ L1(ℝd), Λ⊂ℝd is a finite union of translated lattices such that f+Λ tiles with a weight. We prove that there exists a lattice L⊂ℝd such that f+L also tiles, with a possibly different weight. As a corollary, together with a result of Kolountzakis, it implies that any convex polygon that multi-tiles the plane by translations admits a lattice multi-tiling, of a possibly different multiplicity. Our second result is a new characterization of convex polygons that multi-tile the plane by translations. It also provides a very efficient criteria to tell whether a convex polygon admits translational multi-tilings. As an application, one can easily construct symmetric (2m)-gons, for any m≥ 4, that do not multi-tile by translations. Finally, we prove a convex polygon which is not a parallelogram only admits periodic multiple tilings, if any.