The domino problem of the hyperbolic plane is undecidable, new proof
From MaRDI portal
Publication:6399207
arXiv2205.07317MaRDI QIDQ6399207FDOQ6399207
Authors: M. Margenstern 
Publication date: 15 May 2022
Abstract: The present paper is a new version of the arXiv paper revisiting the proof given in a previous paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is undecidable for the Euclidean plane, initially proved by Robert Berger in 1966. The present construction improves that of the recent arXiv paper. It also strongly reduces the number of prototiles.
This page was built for publication: The domino problem of the hyperbolic plane is undecidable, new proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399207)
