arXiv · 2201.05656
Perturbing Subshifts of Finite Type
Abstract
Given an SFT $\Sigma$ and a finite set $S$ of finite words, let $\Sigma\langle S\rangle$ denote the subshift of $\Sigma$ that avoids $S$. We establish a general criterion under which we can bound the entropy perturbation $h(\Sigma)-h(\Sigma\langle S\rangle)$ from above. As an application, we prove that this entropy difference tends to zero with a sequence of such sets $S_1, S_2, \dots$ under various assumptions on the $S_i$.
Explore related subjects
Keep this discovery
Nick Ramsey. 2022-01-14. Perturbing Subshifts of Finite Type. https://arxiv.org/abs/2201.05656
Cite the original work for its findings. Save a collection to share your selection of sources.