Tilings of \mathbb Z with multisets of distances

arXiv2304.05082MaRDI QIDQ6509601FDOQ6509601

Authors: Andrey B. Kupavskii, Elizaveta Popova 

Abstract: In this paper, we study tilings of $mathbbZ$, that is, coverings of $mathbbZ$ by disjoint sets (tiles). Let $T=d_1,ldots,d_s$ be a given multiset of distances. Is it always possible to tile $mathbbZ$ by tiles, for which the multiset of distances between consecutive points is equal to $T$? In this paper, we give a sufficient condition that such a tiling exists. Our result allows multisets of distances to have arbitrarily many distinct values. Our result generalizes most of the previously known results, all of which dealt with the cases of $2$ or $3$ distinct distances.

This page was built for publication: Tilings of $\mathbb Z$ with multisets of distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509601)