Tilings of \(\mathbb{Z}\) with multisets of distances (Q6553166)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tilings of Z with multisets of distances |
scientific article; zbMATH DE number 7862956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tilings of \(\mathbb{Z}\) with multisets of distances |
scientific article; zbMATH DE number 7862956 |
Statements
Tilings of \(\mathbb{Z}\) with multisets of distances (English)
0 references
11 June 2024
0 references
A tiling of \(\mathbb{Z}\) is collection of disjoint sets, called tiles, which cover \(\mathbb{Z}\). Given a multiset \(T = \{ d_1,d_2,\dots,d_s \}\) of distances, a major question is, does there exist a tiling of \(\mathbb{Z}\) for which the multiset of distances between consecutive points is equal to the multiset \(T\)? The authors generalize numerous previous results, by giving a sufficient condition that such a tiling exits. In this generalization the multiset of distances can have arbitrarily many distinct values.
0 references
tiling
0 references
one-dimensional tiling
0 references
0 references
0.8026080131530762
0 references
0.7941707372665405
0 references
0.7788708806037903
0 references
0.7756931185722351
0 references
0.773028552532196
0 references