arXiv · 1902.03352
Perturbing subshifts of finite type: two words
Abstract
We bound the change in entropy incurred by an irreducible subshift of finite type upon perturbing it by forbidding a pair of admissible words. Lind has proven such bounds in the one-word case, and we adapt his methods. In particular, we introduce multi-word correlation polynomials and study their size, as well as that of their determinant in the two-word case.
Explore related subjects
Keep this discovery
Nick Ramsey. 2019-02-09. Perturbing subshifts of finite type: two words. https://arxiv.org/abs/1902.03352
Cite the original work for its findings. Save a collection to share your selection of sources.