English

Tiling Lattices with Sublattices, I

Combinatorics 2010-06-04 v2

Abstract

We use Fourier methods to prove that if n>1n > 1 translates of sublattices of ZdZ^d tile ZdZ^d, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. This is a multi-dimensional generalization of the Mirsky-Newman Theorem.

Keywords

Cite

@article{arxiv.0905.0441,
  title  = {Tiling Lattices with Sublattices, I},
  author = {David Feldman and James Propp and Sinai Robins},
  journal= {arXiv preprint arXiv:0905.0441},
  year   = {2010}
}

Comments

1 page, 0 figures

R2 v1 2026-06-21T12:58:01.617Z