2019/02/09 by Nick Ramsey, Ramsey, Nick
Mathematics · #37B10 #Dynamical Systems (math.DS) #FOS: Mathematics #math.DS #msc:37B10
paper · pdf · doi:10.48550/arxiv.1902.03352
21 pages
arxiv created 2019/02/09 · arxiv updated 2019/02/12
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.