On non-periodic tilings of the real line by a function
Mihail N. Kolountzakis, Nir Lev

TL;DR
This paper investigates the conditions under which functions can tile the real line through translations, revealing that unbounded support allows non-periodic tilings, but finite local complexity enforces periodicity.
Contribution
It proves that unbounded support enables non-periodic tilings, while finite local complexity still guarantees periodicity, extending understanding of tiling structures.
Findings
Unbounded support allows non-periodic tilings.
Finite local complexity implies periodicity.
Positive, compactly supported functions only tile periodically.
Abstract
It is known that a positive, compactly supported function can tile by translations only if the translation set is a finite union of periodic sets. We prove that this is not the case if is allowed to have unbounded support. On the other hand we also show that if the translation set has finite local complexity, then it must be periodic, even if the support of is unbounded.
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.
