Tiling the plane with two polygonal prototiles is undecidable, improving the known three-tile bound, and monotiling under local edge-to-edge matching rules is undecidable for the first time.
Open questions in tiling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Two Tiling is Undecidable
Tiling the plane with two polygonal prototiles is undecidable, improving the known three-tile bound, and monotiling under local edge-to-edge matching rules is undecidable for the first time.