Metraipolis › archive › dc_3e2c2bfb083c
On the number of tiles in $[n]^d$ — arXiv:2611.05321
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05321
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:48:55.137Z
- SHA-256 of the archived text
aef96a50d81cdb18cd3f2507d9ace3571e1f346ef65a50bab008e5e2136c023b- Stable URL of this page
https://metraipolis.com/documento/dc_3e2c2bfb083c
How to cite
On the number of tiles in $[n]^d$ — arXiv:2611.05321 — arXiv (en), https://arxiv.org/abs/2611.05321 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3e2c2bfb083c (Metraipolis archive dc_3e2c2bfb083c, sha256 aef96a50d81cdb18cd3f2507d9ace3571e1f346ef65a50bab008e5e2136c023b)
BibTeX
@misc{dc3e2c2bfb083c,
title = {On the number of tiles in $[n]^d$ — arXiv:2611.05321},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05321},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3e2c2bfb083c; sha256 aef96a50d81cdb18cd3f2507d9ace3571e1f346ef65a50bab008e5e2136c023b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05321. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $\mathcal{T}(n,d)$ denote the set of subsets of $[n]^d$ that tile $\mathbb Z^d$ by translations, and write $T(n,d)=|\mathcal{T}(n,d)|$. We show that almost every tile in $\mathcal{T}(n,1)$ tiles $\mathbb{Z}$ by an arithmetic progression, thus determining $T(n,1)$ asymptotically. In higher dimensions, we prove that $T(n,d)=O_d\!\left(n^{C_d}3^{n^d/3}\right)$, confirming a conjecture of Benjamini, Kozma and Tzalik. In the other direction, we prove that $T(n,d)\geq (1-o(1))n^{\binom d2}3^{n^d/3}$ when $3\mid n$. This shows one cannot take $C_d=d-1$ for $d\geq 3$, answering a question due to the same authors negatively. Finally, we also obtain nearly tight bounds in dimension two. Our upper bounds rely on a new observation realising tiles as maximal independent sets in truncated Cayley graphs.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.05321 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:32:32.044Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).