Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.00192

On the Undecidability of Tiling the $3$-dimensional Space with a Set of $3$ Polycubes

Chao Yang·Zhujun Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent years. One is the existence of an aperiodic monotile in a space of sufficiently large dimension. The other is the undecidability of translational tiling of periodic subsets of space with a single tile, provided that the dimension of the space is part of the input. These two results support the following conjecture: there is a fixed dimension $n$ such that translational tiling with a single tile is undecidable. One strategy towards solving this conjecture is to prove the undecidability of translational tiling of a fixed dimension space with a set of $k$ tiles, for a positive integer $k$ as small as possible. In this paper, it is shown that translational tiling the $3$-dimensional space with a set of $3$ polycubes is undecidable.

Explore related subjects

math.COcs.CGmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chao Yang, Zhujun Zhang. 2025-07-31. On the Undecidability of Tiling the $3$-dimensional Space with a Set of $3$ Polycubes. https://arxiv.org/abs/2508.00192

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗