Deciding translational tiling of Z^4 by three connected polyhypercubes is undecidable, shown by reduction from Wang's domino problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Undecidability of Translational Tiling with Three Tiles
Deciding translational tiling of Z^4 by three connected polyhypercubes is undecidable, shown by reduction from Wang's domino problem.