The finite tiling problem is undecidable in the hyperbolic plane
Maurice Margenstern
cs.CGarXiv:cs/0703147
Abstract
In this paper, we consider the finite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari in 1994. Here, we prove that the same problem for the hyperbolic plane is also undecidable.
Create a lesson
Related papers
A Bicriteria Approximation Scheme for the Minimum Well-Separated Pair Decomposition
Guilherme D. da Fonseca
Tiling 3D by Translates of a Single Polycube is Undecidable
Erik D. Demaine, Stefan Langerman
Deterministic Distance Selection in O(n4/3) Time
Haitao Wang
Simulated Annealing for Antenna Placements
Mikkel Abrahamsen, Jacobus Conradi, Asbjørn Lind
Exposition of an approximation algorithm for mixed volumes of a constant number of convex bodies
Hariharan Narayanan
Tight Bounds for Tusnády's Problem in the Plane
Zhewei Wei