Mathematics > Combinatorics
arXiv:2303.07956 (math)
[Submitted on 14 Mar 2023 (v1), last revised 8 Jul 2026 (this version, v2)]
Abstract:It is proved that the number of subsets of $[n]^d$ that tile $\mathbb{Z}^d$ is $\left(3^{\frac{1}{3}}\right)^{n^d \pm o(n^d)}$.
Submission history
From: Elad Tzalik [view email]
[v1]
Tue, 14 Mar 2023 14:58:41 UTC (7 KB)
[v2]
Wed, 8 Jul 2026 17:07:47 UTC (8 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.




























