Saved in:
Bibliographic Details
Main Authors: Kupavskii, Andrey, Popova, Elizaveta
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2304.05082
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910394407190528
author Kupavskii, Andrey
Popova, Elizaveta
author_facet Kupavskii, Andrey
Popova, Elizaveta
contents In this paper, we study tilings of $\mathbb Z$, that is, coverings of $\mathbb Z$ by disjoint sets (tiles). Let $T=\{d_1,\ldots, d_s\}$ be a given multiset of distances. Is it always possible to tile $\mathbb Z$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2304_05082
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Tilings of $\mathbb Z$ with multisets of distances
Kupavskii, Andrey
Popova, Elizaveta
Combinatorics
In this paper, we study tilings of $\mathbb Z$, that is, coverings of $\mathbb Z$ by disjoint sets (tiles). Let $T=\{d_1,\ldots, d_s\}$ be a given multiset of distances. Is it always possible to tile $\mathbb Z$ 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.
title Tilings of $\mathbb Z$ with multisets of distances
topic Combinatorics
url https://arxiv.org/abs/2304.05082