Papers
Topics
Authors
Recent
Search
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.

Citations (5)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Chao Yang 
  2. Zhujun Zhang 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up