Perturbing subshifts of finite type: two words
Dynamical Systems
2019-02-12 v1
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.
Cite
@article{arxiv.1902.03352,
title = {Perturbing subshifts of finite type: two words},
author = {Nick Ramsey},
journal= {arXiv preprint arXiv:1902.03352},
year = {2019}
}
Comments
21 pages