Ethan M. Coven, Aaron D. Meyerowitz
Published 1998-02-27Version 1
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For sets of prime power size, it was solved by D. Newman [J. Number Theory 9 (1977), 107--111]. We solve it for sets of size having at most two prime factors. The conditions are always sufficient, but it is unknown whether they are necessary for all finite sets.
Union-Closed vs Upward-Closed Families of Finite Sets
Graphs of bounded depth-$2$ rank-brittleness
On the Equitable Choosability of the Disjoint Union of Stars
![QR code for arXiv:math/9802122 [math.CO]](http://oss.arxitics.com/images/favicon.svg)