Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
From MaRDI portal
Publication:2073015
Recommendations
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
- On the entropy of multidimensional multiplicative integer subshifts
- Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type
- Higher-dimensional subshifts of finite type, factor maps and measures of maximal entropy.
- Multidimensional random subshifts of finite type and their large deviations
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
- The large scale geometry of strongly aperiodic subshifts of finite type
- Topological entropy of a class of subshifts of finite type
- Multifractal decomposition of the entropies spectrum for countable subshifts in finer levels sets
Cites work
- scientific article; zbMATH DE number 6498000 (Why is no real title available?)
- A characterization of the entropies of multidimensional shifts of finite type
- Characterizations of periods of multi-dimensional shifts
- Effect of quantified irreducibility on the computability of subshift entropy
- Endomorphisms and automorphisms of the shift dynamical system
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
- Fixed-point tile sets and their applications
- Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers
- Medvedev degrees of two-dimensional subshifts of finite type
- On the dynamics and recursive properties of multidimensional symbolic systems
- On the expressive power of quasiperiodic SFT
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- The Arithmetical Hierarchy of Real Numbers
- Tilings, substitution systems and dynamical systems generated by them
- Turing degree spectra of minimal subshifts
- Turing degrees of multidimensional SFTs
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(4)- Effect of quantified irreducibility on the computability of subshift entropy
- Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type
- A complete proof that square ice entropy is
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
This page was built for publication: Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2073015)
