A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of $8$ polyominoes
<|reference_start|>A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of $8$ polyominoes: 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.<|reference_end|>
@article{yang2024a,
    title={A proof of Ollinger's conjecture: undecidability of tiling the plane
  with a set of $8$ polyominoes},
    author={Chao Yang, Zhujun Zhang},
    journal={arXiv preprint arXiv:2403.13472},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.13472},
    primaryClass={math.CO cs.CC math.MG}
}