Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type

DOI10.3934/dcds.2023001zbMath1519.37013arXiv2203.00434OpenAlexW4319991474MaRDI QIDQ6041080

Mathieu Sablik, Solène J. Esnay

Publication date: 25 May 2023

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.00434

zbMATH Keywords

entropysubshift of finite typesymbolic dynamicsdecidabilitysubshiftdomino problemprojective subaction

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Multidimensional shifts of finite type (37B51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces
• Simulation of effective subshifts by two-dimensional subshifts of finite type
• Fixed-point tile sets and their applications
• The large scale geometry of strongly aperiodic subshifts of finite type
• Subsystem entropy for \(\mathbb {Z}^{d}\) sofic shifts
• A characterization of the entropies of multidimensional shifts of finite type
• A small aperiodic set of Wang tiles
• Effect of quantified irreducibility on the computability of subshift entropy
• Tilings, substitution systems and dynamical systems generated by them
• Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
• On the entropies of subshifts of finite type on countable amenable groups
• Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
• Strongly aperiodic subshifts on surface groups
• Undecidability and nonperiodicity for tilings of the plane
• The Domino Problem for Self-similar Structures
• The Tiling Problem Revisited (Extended Abstract)
• Perturbations of Shifts of Finite Type
• About the Domino Problem for Subshifts on Groups
• An Introduction to Symbolic Dynamics and Coding
• An aperiodic set of 11 Wang tiles
• The undecidability of the domino problem

This page was built for publication: Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type