On the entropy of \(\mathbb{Z}^d\) subshifts of finite type

DOI10.1016/0024-3795(95)00676-1zbMath0893.54031OpenAlexW2471026571WikidataQ127975383 ScholiaQ127975383MaRDI QIDQ676028

Shmuel Friedland

Publication date: 11 August 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00676-1

zbMATH Keywords

\(\mathbb{Z}^d\) subshift of finite typecombinatorial entropy

Mathematics Subject Classification ID

Related Items (13)

Representation and poly-time approximation for pressure of \(\mathbb Z^2\) lattice models in the non-uniqueness region ⋮ The topological strong spatial mixing property and new conditions for pressure approximation ⋮ Capacity of Higher-Dimensional Constrained Systems ⋮ Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces ⋮ Computing the Hausdorff dimension of subshifts using matrices ⋮ A complete proof that square ice entropy is ⋮ Four-cycle free graphs, height functions, the pivot property and entropy minimality ⋮ Approximating the hard square entropy constant with probabilistic methods ⋮ Positive expansiveness versus network dimension in symbolic dynamical systems ⋮ A characterization of the entropies of multidimensional shifts of finite type ⋮ Spatial chaos of Wang tiles with two symbols ⋮ On the dynamics and recursive properties of multidimensional symbolic systems ⋮ Theory of computation of multidimensional entropy with an application to the monomer-dimer problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropy of algebraic maps
• Tilings, substitution systems and dynamical systems generated by them
• Undecidability and nonperiodicity for tilings of the plane
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
• Matrix Subshifts for Z ^v Symbolic Dynamics
• The topological entropy of cellular automata is uncomputable
• The undecidability of the domino problem

This page was built for publication: On the entropy of \(\mathbb{Z}^d\) subshifts of finite type