Skip to main content
SpringerLink
Log in

The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane

  • Conference paper
Book cover Reachability Problems (RP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5797))

Included in the following conference series:

Abstract

In this paper, we consider the periodic tiling problem which was proved undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov, see [3]. Here, we prove that the same problem for the hyperbolic plane is also undecidable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berger, R.: The undecidability of the domino problem. Memoirs of the American Mathematical Society 66, 1–72 (1966)

    MathSciNet  MATH  Google Scholar 

  2. Chelghoum, K., Margenstern, M., Martin, B., Pecci, I.: Cellular automata in the hyperbolic plane: proposal for a new environment. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 678–687. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Yu, G., Koriakov, I.: A remark on Berger’s paper on the domino problem. Siberian Mathematical Journal 13, 459–463 (1972)

    Google Scholar 

  4. Kari, J.: The Tiling Problem Revisited. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 72–79. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Margenstern, M.: New Tools for Cellular Automata of the Hyperbolic Plane. Journal of Universal Computer Science 6(12), 1226–1252 (2000)

    MathSciNet  MATH  Google Scholar 

  6. Margenstern, M.: Theory. In: Cellular Automata in Hyperbolic Spaces, OCP, Philadelphia, vol. 1, 422 p. (2007)

    Google Scholar 

  7. Margenstern, M.: Implementation and computations. In: Cellular Automata in Hyperbolic Spaces, OCP, Philadelphia, vol. 2, 360 p. (2008)

    Google Scholar 

  8. Margenstern, M.: The finite tiling problem is undecidable in the hyperbolic plane, arxiv:cs.CG/0703147, 8 p. (March 2007)

    Google Scholar 

  9. Margenstern, M.: The Domino Problem of the Hyperbolic Plane is Undecidable. Bulletin of the EATCS 93, 220–237 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Margenstern, M.: The domino problem of the hyperbolic plane is undecidable. Theoretical Computer Science 407, 29–84 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Margenstern, M.: The Finite Tiling Problem Is Undecidable in the Hyperbolic Plane. International Journal of Foundations of Computer Science 19(4), 971–982 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12, 177–209 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  13. Robinson, R.M.: Undecidable tiling problems in the hyperbolic plane. Inventiones Mathematicae 44, 259–264 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  14. Wang, H.: Proving theorems by pattern recognition. Bell System Tech. J. 40, 1–41 (1961)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Théorique et Appliquée, EA 3097, Université de Metz, I.U.T. de Metz, Département d’Informatique, Île du Saulcy, 57045, Metz Cedex, France

    Maurice Margenstern

Authors
  1. Maurice Margenstern
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Polytechnique, Laboratoire d’ Informatique (LIX), 91128, Palaiseau Cedex, France

    Olivier Bournez

  2. Department of Computer Science, Ashton Building, University of Liverpool, L69 3BX, Liverpool, England

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Margenstern, M. (2009). The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. In: Bournez, O., Potapov, I. (eds) Reachability Problems. RP 2009. Lecture Notes in Computer Science, vol 5797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04420-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04420-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04419-9

  • Online ISBN: 978-3-642-04420-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation