Abstract

AbstractA finite set of integersAtiles the integers by translations if$\mathbb {Z}$can be covered by pairwise disjoint translated copies ofA. Restricting attention to one tiling period, we have$A\oplus B=\mathbb {Z}_M$for some$M\in \mathbb {N}$and$B\subset \mathbb {Z}$. This can also be stated in terms of cyclotomic divisibility of the mask polynomials$A(X)$and$B(X)$associated withAandB.In this article, we introduce a new approach to a systematic study of such tilings. Our main new tools are the box product, multiscale cuboids and saturating sets, developed through a combination of harmonic-analytic and combinatorial methods. We provide new criteria for tiling and cyclotomic divisibility in terms of these concepts. As an application, we can determine whether a setAcontaining certain configurations can tile a cyclic group$\mathbb {Z}_M$, or recover a tiling set based on partial information about it. We also develop tiling reductions where a given tiling can be replaced by one or more tilings with a simpler structure. The tools introduced here are crucial in our proof in [24] that all tilings of period$(pqr)^2$, where$p,q,r$are distinct odd primes, satisfy a tiling condition proposed by Coven and Meyerowitz [2].

Highlights

  • A set A ⊂ Z tiles the integers by translations if Z can be covered by pairwise disjoint translates of A

  • Newman [34] proved that any tiling of Z by a finite set A must be periodic – that is, T = B ⊕ MZ for some finite set B ⊂ Z such that | A||B| = M

  • A ⊕ B is a factorisation of the cyclic group ZM, with B as the tiling complement

Read more

Summary

Introduction

A set A ⊂ Z tiles the integers by translations if Z can be covered by pairwise disjoint translates of A. If A ⊕ B = ZM is a tiling, B satisfies (T2) if and only if its tiling complement A can be replaced by a highly structured ‘standard set’ A♭ with the same prime-power cyclotomic divisors as A Such standard sets were already used in [2] to prove that (T1) and (T2) imply tiling. While the subgroup reduction is sufficient to prove Theorem 1.1, tilings with three or more distinct prime factors include cases where such inductive arguments do not appear to be applicable. In addition to applications to proving structural conditions such as (T2), we are able to use saturating sets to identify sets A ⊂ ZM that do not tile ZM based on the presence of certain configurations Results of this type include Lemma 7.10 and Proposition 7.11.

Multisets and mask polynomials
Array coordinates
Cyclotomic polynomials and cyclotomic divisibility
Standard tiling complements
This means that k
Reordering the primes if necessary, we may assume that p1α1
A Fourier-analytic identity
Definitions
Classic cuboids
Multiscale cuboids
Subgroup reduction
Slab reduction
Fibers and cofibers
Cofibers and cofibered structures
Fiber shifting
Fibers and 1-dimensional saturating spaces
Examples and applications
Tiling reductions
Saturating sets
Subspace bounds
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call