Tiling Lattices with Sublattices, I
classification
🧮 math.CO
keywords
sublatticestranslatesarithmeticcartesianfouriergeneralizationlatticesmethods
read the original abstract
We use Fourier methods to prove that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.