Tiling the integers with translates of one finite set

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages

Keywords

Combinatorics, Group Theory, 05B45 (Primary) 11B75, 20K01 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/76647

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9802122
 http://arxiv.org/abs/math/9802122

Collections

arXiv