Entropies realizable by block gluing Z^d shifts of finite type
The authors consider the problem of describing the class of real numbers which are topological entropies of \(\mathbb Z^d\) shifts of finite type; the case is of ``block gluing -- a uniform mixing property introduced in the paper of \textit{M. Boyle} et al. [Trans. Am. Math. Soc. 362, No. 9, 4617--4653 (2010; Zbl 1207.37011)]. The results complete those of \textit{M. Hochman} and \textit{T. Meyerovitch} [Ann. Math. (2) 171, No. 3, 2011--2038 (2010; Zbl 1192.37022)]. The main results of this paper are contained in the following two theorems: Theorem 1.4. For each block gluing \(\mathbb Z^2\) shift of finite type there exists some constant \(C\in \mathbb N\) such that the topological entropy of the shift is computable with rate \((2^{C\cdot n^2})_{n\in \mathbb N}\). Theorem 1.7. Suppose \(d\geq 3\). For every \(\alpha\in \mathbb R^+_0\) having a representation \(\alpha=\alpha'\cdot\log M\) for a natural number \(M>1\) and \(\alpha'\in \mathbb R^+_0\) which satisfies a compatibility condition (defined in the paper) there exists a block gluing \(\mathbb Z^d\) shift of finite type with topological entropy.
- A characterization of the entropies of multidimensional shifts of finite type
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
- shifts of finite type without equal entropy full shift factors
- Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
- Topological entropy of a class of subshifts of finite type
- A characterization of the entropies of multidimensional shifts of finite type
- An Introduction to Symbolic Dynamics and Coding
- Approximating the hard square entropy constant with probabilistic methods
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1327765 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Multidimensional sofic shifts without separation and their factors
- On the dynamics and recursive properties of multidimensional symbolic systems
- Perturbations of multidimensional shifts of finite type
- Planar lattice gases with nearest-neighbor exclusion
- Projectional entropy and the electrical wire shift
- shifts of finite type without equal entropy full shift factors
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- The 1-Vertex Transfer Matrix and Accurate Estimation of Channel Capacity
- The entropies of topological Markov shifts and a related class of algebraic integers
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The undecidability of the domino problem
- Tilings, substitution systems and dynamical systems generated by them
- Undecidability and nonperiodicity for tilings of the plane
- Effect of quantified irreducibility on the computability of subshift entropy
- The work of Mike Hochman on multidimensional symbolic dynamics and Borel dynamics
- Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type
- Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
- Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach
- Dismantlability, connectedness, and mixing in relational structures
- On the topological entropy of subshifts of finite type on free semigroups
- Projectional entropy and the electrical wire shift
- A sufficient condition for non-soficness of higher-dimensional subshifts
- shifts of finite type without equal entropy full shift factors
- Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces
- Mixing properties of tree-shifts
- Factoring onto \(\mathbb {Z}^d\) subshifts with the finite extension property
- A class of nonsofic multidimensional shift spaces
- Tree-shifts: the entropy of tree-shifts of finite type
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Computability at zero temperature
- On the computability of rotation sets and their entropies
- 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
- Approximating the hard square entropy constant with probabilistic methods
- Computability of pressure for subshifts on countable amenable groups
- On a Rice theorem for dynamical properties of SFTs on groups
- Short-range and long-range order: a transition in block-gluing behavior in Hom shifts
- Undecidability of the block gluing classes of homshifts
- A characterization of the entropies of multidimensional shifts of finite type
This page was built for publication: Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352245)
