Paperlane

no. 15 · Monday 16 November 2026

Tiling 3D Space by (Translates of) a Single Polycube is Undecidable

Erik D. Demaine and Stefan Langerman

math.CO · v2 · 10 pp

Abstract

We prove co-RE-completeness, and thus undecidability, of the following problem: given a single (connected) polycube, decide whether it tiles 3D Euclidean space by translations. The same result holds if we also allow rotations and/or reflections. We reduce from Wang tiling using the decorated two-prime Sudoku construction of Greenfeld and Tao and a cyclic encoding adapted from OpenAI's 3D aperiodic tile, and apply a reduction of Kim to make the prototile connected (via faces). Dimension three is optimal: translational monotiling is known to be decidable in $\mathbb{Z}^2$ and for a single (possibly disconnected) polyomino in $\mathbb{R}^2$.

comments
10 pages, 2 figures, 2 tables, 15 snippets. Added rotation/reflection results and corresponding table
fields
Combinatorics, Metric Geometry
pdf ↗ page arXiv:2610.12392 ↗