Back to Search
Start Over
A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of $8$ polyominoes
- Publication Year :
- 2024
-
Abstract
- We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. 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.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2403.13472
- Document Type :
- Working Paper