On entropies of block-gluing subshifts

Abstract: A subshift $X$ is called $c$-block gluing if for any integer $n\geq c$ and any two blocks $u$ and $v$ from the language of $X$ there exists an element of $X$ which has occurrences of $u$ and $v$ at distance $n$. In this note we study the topological entropies of $c$-block gluing binary one-dimensional subshifts. We define the set $R_c$ to be the set of entropies of all $c$-block-gluing subshifts, and $R=\cup_{c\in \mathbb{N}} R_c$. We show that the set $R$ is dense, while $R_1$ and $R_2$ are not; in particular, they have isolated points. We conjecture that the same holds for any $c$.