Skip to main navigation Skip to search Skip to main content

Computational characterization of surface entropies for Z2subshifts of finite type

  • ENS Paris-Saclay
  • ENS Paris-Saclay
  • Normandy University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Citations (Scopus)

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 2hn2, 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 Π3 real numbers of [0,+∞].

Original languageEnglish
Title of host publication48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
EditorsNikhil Bansal, Emanuela Merelli, James Worrell
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771955
DOIs
Publication statusPublished - 1 Jul 2021
Externally publishedYes
Event48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 - Virtual, Online, United Kingdom
Duration: 12 Jul 2021 → 16 Jul 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume198
ISSN (Print)1868-8969

Conference

Conference48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
Country/TerritoryUnited Kingdom
CityVirtual, Online
Period12/07/21 → 16/07/21

Keywords

  • 2D subshifts
  • Arithmetical hierarchy of real numbers
  • Surface entropy
  • Symbolic dynamics

Fingerprint

Dive into the research topics of 'Computational characterization of surface entropies for Z2subshifts of finite type'. Together they form a unique fingerprint.

Cite this