The Coven-Meyerowitz tiling conditions for 3 odd prime factors

Abstract

It is well known that if a finite set A⊂Z tiles the integers by translations, then the translation set must be periodic, so that the tiling is equivalent to a factorization A B=ZM of a finite cyclic group. We are interested in characterizing all finite sets A⊂Z that have this property. Coven and Meyerowitz (1998) proposed conditions (T1), (T2) that are sufficient for A to tile, and necessary when the cardinality of A has at most two distinct prime factors. They also proved that (T1) holds for all finite tiles, regardless of size. It is not known whether (T2) must hold for all tilings with no restrictions on the number of prime factors of |A|. We prove that the Coven-Meyerowitz tiling condition (T2) holds for all integer tilings of period M=(pipjpk)2, where pi,pj,pk are distinct odd primes. The proof also provides a classification of all such tilings.

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…