Quasi-periodic tiling with multiplicity: a lattice enumeration approach
Swee Hong Chan

TL;DR
This paper extends tiling theory by showing that under certain conditions, a convex polytope that k-tiles space with a multiset contained in a quasi-periodic set can be re-tiled with a lattice, advancing the understanding of multi-tiling structures.
Contribution
It proves that k-tilings with multisets in quasi-periodic sets can be realized with lattice tilings, strengthening previous results and supporting a broader conjecture.
Findings
Generalizes tiling results to higher dimensions
Shows existence of lattice tilings from quasi-periodic multisets
Supports conjecture that all k-tilings can be lattice tilings
Abstract
The -tiling problem for a convex polytope is the problem of covering with translates of using a discrete multiset of translation vectors, such that every point in is covered exactly times, except possibly for the boundary of and its translates. A classical result in the study of tiling problems is a theorem of McMullen that a convex polytope that 1-tiles with a discrete multiset can, in fact, 1-tile with a lattice . A generalization of McMullen's theorem for -tiling was conjectured by Gravin, Robins, and Shiryaev, which states that if -tiles with a discrete multiset , then -tiles with a lattice for some . In this paper, we consider the case when -tiles with a discrete multiset …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
