← 研踪 PaperTrailarXiv:2610.12392 · v2
Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
首次提交 2026-10-09 01:39
版本更新 2026-11-14 02:47
雷达观测 2026-11-16 13:44
摘要
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 and for a single (possibly disconnected) polyomino in .
作者备注:10 pages, 2 figures, 2 tables, 15 snippets. Added rotation/reflection results and corresponding table
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-14 02:47 · 最新观测版本
Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
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 and for a single (possibly disconnected) polyomino in .
查看此版本解读 →查看此版本原文 ↗