Undecidability of tiling the plane with a fixed number of Wang bars
<|reference_start|>Undecidability of tiling the plane with a fixed number of Wang bars: To study the fixed parameter undecidability of tiling problem for a set of Wang tiles, Jeandel and Rolin show that the tiling problem for a set of 44 Wang bars is undecidable. In this paper, we improve their result by proving that whether a set of 29 Wang bars can tile the plane is undecidable. As a consequence, the tiling problem for a set of Wang tiles with color deficiency of 25 is also undecidable.<|reference_end|>
@article{yang2024undecidability,
    title={Undecidability of tiling the plane with a fixed number of Wang bars},
    author={Chao Yang, Zhujun Zhang},
    journal={arXiv preprint arXiv:2404.04504},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.04504},
    primaryClass={math.CO cs.CC math.MG}
}