2000 character limit reached
A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of $8$ polyominoes
Published 20 Mar 2024 in math.CO, cs.CC, and math.MG | (2403.13472v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.