Skip to main content

Aperiodic Tilings and Entropy

  • Conference paper
Developments in Language Theory (DLT 2014)

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

Included in the following conference series:

Abstract

In this paper we present a construction of Kari-Culik aperiodic tile set, the smallest known until now. Our construction is self-contained and organized to allow reasoning on properties of the resulting sets of tilings. With the help of this construction, we prove that this tileset has positive entropy. We also explain why this result was not expected.

Supported by ANR project EMC NT09 555297.

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

Access this chapter

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. Börger, E., Grädel, E., Gurevich, Y.: Classical Decision problem. Perspectives in Mathematical Logic. Springer (1997)

    Google Scholar 

  2. Wang, H.: Dominoes and the ∀∃∀ case of the decision problem. Mathematical Theory of Automata, 23–55 (1963)

    Google Scholar 

  3. Berger, R.: The Undecidability of the Domino Problem. PhD thesis. Harvard University (1964)

    Google Scholar 

  4. Robinson, R.: Undecidability and Nonperiodicity for Tilings of the Plane. Inventiones Mathematicae 12(3) (1971)

    Google Scholar 

  5. Kari, J.: A small aperiodic set of wang tiles. Discrete Mathematics 160, 259–264 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Culik II, K.: An aperiodic set of 13 wang tiles. Discrete Mathematics 160, 245–251 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Monteil, T.: Kari-Culik tile sets are too aperiodic to be substitutive. In: FRAC (2013)

    Google Scholar 

  8. Ollinger, N.: Two-by-two substitution systems and the undecidability of the domino problem. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 476–485. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Durand, B., Levin, L.A., Shen, A.: Complex tilings. The Journal of Symbolic Logic 73(2), 593–673 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. Durand, B., Romashchenko, A.E., Shen, A.: Fixed-point tile sets and their applications. J. Comput. Syst. Sci. 78(3), 731–764 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  11. Nikola, N., Hexner, D., Levine, D.: Entropic commensurate-incommensurate transition. Phys. Rev. Lett. 110, 125701 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Durand, B., Gamard, G., Grandjean, A. (2014). Aperiodic Tilings and Entropy. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09698-8_15

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09697-1

  • Online ISBN: 978-3-319-09698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics