The Domino Problem of the Hyperbolic Plane Is Undecidable

Simple item page
dc.creatorMargenstern, Maurice
dc.date2007-06-28
dc.date.accessioned2026-07-07T09:33:15Z
dc.date.available2026-07-07T09:33:15Z
dc.descriptionIn this paper, we prove 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.
dc.description18 pages, This is a synthesis of previous deposits
dc.identifierhttps://arxiv.org/abs/0706.4161
dc.identifierhttp://arxiv.org/abs/0706.4161
dc.identifierThe Bulletin of EATCS, 93(Oct.), (2007), 220-237
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159069
dc.subjectComputational Geometry
dc.subjectDiscrete Mathematics
dc.subjectF.2.2
dc.titleThe Domino Problem of the Hyperbolic Plane Is Undecidable
dc.typetext

Files

Collections

arXiv