Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type (Q2352245)

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.