Given a single polycube, can copies of it tile three-dimensional space using only translations? We prove that this problem is undecidable, even for polycubes connected through facets, including when rotations and/or reflections are allowed. More precisely, these problems are co-RE-complete. Dimension three is optimal for translation only: the corresponding problem in two dimensions is decidable.
The GitHub repository contains the document sources, figures, finite verification code, and a complete Lean formalization of the reduction and main results. See the formalization notes for formal statements, checked proofs, and build instructions.