Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type
type: Item
instance of: scholarly article
title: Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type
zbMATH Open document ID: 1495.37016
author: Silvère Gangloff
published in: Discrete and Continuous Dynamical Systems
publication date: 2022-01-24T00:00:00Z
review text: Let \(\mathcal{A}\) be an alphabet, that is any finite set and \(d\) a positive integer. The shift of dimension \(d\) over \(\mathcal{A}\) is the dynamical system obtained by the action of \(\mathbb{Z}^d\) on \(\mathcal{A}^{\mathbb{Z}^d}\) by shifting the indices. By Tychonoff theorem, \(\mathcal{A}^{\mathbb{Z}^d}\)is compact for the product topology. A subshift is merely a \(\mathbb{Z}^d\)-invariant closed subset. Roughly speaking, a subshift \(X\) is of finite type if the belonging of \(x\in\mathcal{A}^{\mathbb{Z}^d}\) to \(X\) can be decided by finitely patterns of finite size. A subshift is minimal if there is no non-empty invariant closed subset. It is known that minimal multidimensional subhifts of finite type have entropy zero. Here the author uses the entropy dimension that is a topological asymptotic invariant of the subshift. It was known thanks to results by \textit{M. Hochman} and \textit{T. Meyerovitch} [Ann. Math. (2) 171, No. 3, 2011--2038 (2010; Zbl 1192.37022)] that entropy dimensions are \(\pi_1\)-computable numbers. The main result of this paper is the fact that minimal tridimensional subshifts of finite type have entropy dimensions that are \(\Delta_2\)-computable numbers. Recall that a real number \(x\) is \(\Delta_2\)-computable if there is a Turing machine that produces a sequence of rational numbers \((r_n)\) such that \(x=\lim_n r_n\). The author explains that his ideas allow to get the same result in higher dimension (even if no formal proof is provided). In dimension two the situation is different and is not treated here. Without the finite-type assumption, in dimension two, it is known that any non-negative real number at most 2 can be realized as entropy dimension of a subshift. For the main result, the construction of the desired subshift is illustrated by a large number of pictures. The author states that a longer version of the paper with proofs of well-known facts is available but there is no reference to it and it seems not availabl…
reviewed by: Bruno Duchesne
Mathematics Subject Classification ID: 37B51
Mathematics Subject Classification ID: 37A44
Mathematics Subject Classification ID: 37B10
Mathematics Subject Classification ID: 37B40
Mathematics Subject Classification ID: 37C45
zbMATH DE Number: 7463736
zbMATH Keywords: symbolic dynamics
zbMATH Keywords: entropy dimension
zbMATH Keywords: subshifts of finite type
zbMATH Keywords: computability
MaRDI profile type: Publication
full work available at URL: dcds.2021143
OpenAlex ID: W3207715050
cites work: Q3448498
cites work: On the Expressive Power of Quasiperiodic SFT.
cites work: Complex tilings
cites work: Q3735714
cites work: A characterization of the entropies of multidimensional shifts of finite type
cites work: On the dynamics and recursive properties of multidimensional symbolic systems
cites work: Turing degree spectra of minimal subshifts
cites work: Characterizations of periods of multi-dimensional shifts
cites work: Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers
cites work: Q5590814
cites work: Tilings, substitution systems and dynamical systems generated by them
cites work: Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
cites work: Undecidability and nonperiodicity for tilings of the plane
DOI: 10.3934/DCDS.2021143
description: scientific article; zbMATH DE number 7463736