Translational Tiling with 8 Polyominoes is Undecidable
摘要
We show that translational tiling of the plane with a set of 8 polyominoes is undecidable, which answers a question posted by Ollinger. The techniques employed in our proof include a different orientation for simulating the Wang tiles in polyomino and a new method for encoding the colors of Wang tiles.