
arXiv: 1505.03697
Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$ for some $d$. This resolves a conjecture of Chalcraft.
23 pages, 19 figures; slightly updated
Combinatorial aspects of tessellation and tiling problems, Chalcraft's conjecture, Polyominoes, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05B45, 05B50, 52C22
Combinatorial aspects of tessellation and tiling problems, Chalcraft's conjecture, Polyominoes, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 05B45, 05B50, 52C22
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
