Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@relcfp@mastodon.social
2024-11-28 12:59:10

[ April 28, 2025] CFP for publication or other deadline: null philevents.org/event/show/1276

@dougmerritt@mathstodon.xyz
2024-11-20 22:50:46

"Tiling with Three Polygons is Undecidable"
Erik D. Demaine; Stefan Langerman 17 Sep 2024
Abstract
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding reflections)? This result improves on the best previous construction which requires five polygons.
...
It remains open whether tiling …