Document Open Access Logo

Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite Type

Authors Antonin Callard, Pascal Vanier

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2021.122.pdf
  • Filesize: 0.88 MB
  • 20 pages

Document Identifiers

Author Details

Antonin Callard
  • Université Paris-Saclay, ENS Paris-Saclay, Département Informatique, 91190 Gif-sur-Yvette, France
Pascal Vanier
  • Normandie Univ, UNICAEN, ENSICAEN, CNRS, GREYC, 14000 Caen, France

Funding

This research was partially funded by ANR JCJC 2019 19-CE48-0007-01.

Acknowledgements

The authors would like to thank Ronnie Pavlov for answering their many questions about surface entropy when they started this work, and Benjamin Hellouin de Menibus for the relecturing. Finally, we warmly thank the anonymous reviewers for their many helpful remarks and improvements.

Cite As Get BibTex

Antonin Callard and Pascal Vanier. Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite Type. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 122:1-122:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.ICALP.2021.122

Abstract

Subshifts of finite type (SFTs) are sets of colorings of the plane that avoid a finite family of forbidden patterns. In this article, we are interested in the behavior of the growth of the number of valid patterns in SFTs. While entropy h corresponds to growths that are squared exponential 2^{hn²}, surface entropy (introduced in Pace’s thesis in 2018) corresponds to the eventual linear term in exponential growths. We give here a characterization of the possible surface entropies of SFTs as the Π₃ real numbers of [0,+∞].

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Discrete mathematics
  • Theory of computation → Models of computation
Keywords
  • surface entropy
  • arithmetical hierarchy of real numbers
  • 2D subshifts
  • symbolic dynamics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Nathalie Aubrun and Mathieu Sablik. Simulation of effective subshifts by two-dimensional subshifts of finite type. Acta Applicandae Mathematicae, 126(1):35-63, 2013. URL: https://doi.org/10.1007/s10440-013-9808-5.
  2. Robert Berger. The Undecidability of the Domino Problem. Number 66 in Memoirs of the American Mathematical Society. The American Mathematical Society, 1966. Google Scholar
  3. Bruno Durand, Andrei Romashchenko, and Alexander Shen. Effective Closed Subshifts in 1D Can Be Implemented in 2D. In Fields of Logic and Computation, number 6300 in Lecture Notes in Computer Science, pages 208-226. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15025-8_12.
  4. Bruno Durand, Andrei Romashchenko, and Alexander Shen. Fixed-point tile sets and their applications. Journal of Computer and System Sciences, 78(3):731-764, May 2012. URL: https://doi.org/10.1016/j.jcss.2011.11.001.
  5. Yuri Gurevich and I Koryakov. Remarks on Berger’s paper on the domino problem. Siberian Math. Journal, pages 319-320, 1972. Google Scholar
  6. David Harel. Recurring Dominoes: Making the Highly Undecidable Highly Understandable. Annals of Discrete Mathematics, 24:51-72, 1985. Google Scholar
  7. Michael Hochman. On the dynamics and recursive properties of multidimensional symbolic systems. Inventiones Mathematicae, 176(1):2009, April 2009. Google Scholar
  8. Michael Hochman and Tom Meyerovitch. A characterization of the entropies of multidimensional shifts of finite type. Annals of Mathematics, 171(3):2011-2038, May 2010. URL: https://doi.org/10.4007/annals.2010.171.2011.
  9. Konrad Jacobs and Michael Keane. 0-1-sequences of Toeplitz type. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 13(2):123-131, 1969. URL: https://doi.org/10.1007/BF00537017.
  10. Emmanuel Jeandel and Pascal Vanier. Characterizations of periods of multidimensional shifts. Ergodic Theory and Dynamical Systems, 35(2):431-460, 2015. URL: https://doi.org/10.1017/etds.2013.60.
  11. S.C. Kleene. Two Papers on the Predicate Calculus, chapter Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols, pages 31-71. Number 10 in Memoirs of the American Mathematical Society. American Mathematical Society, 1952. Google Scholar
  12. Douglas A. Lind and Brian Marcus. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, New York, NY, USA, 1995. Google Scholar
  13. Tom Meyerovitch. Growth-type invariants for ℤ^d subshifts of finite type and arithmetical classes of real numbers. Inventiones Mathematicae, 184(3), 2010. URL: https://doi.org/10.1007/s00222-010-0296-1.
  14. Dennis Pace. Surface Entropy of Shifts of Finite Type. PhD thesis, University of Denver, 2018. Google Scholar
  15. Xizhong Zheng and Klaus Weihrauch. Arithmetical hierarchy of real numbers. In Mathematical Foundations of Computer Science (MFCS), pages 23-33, 1999. URL: https://doi.org/10.1007/3-540-48340-3_3.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact