Ergodic optimization for countable alphabet subshifts of finite type
Oliver Jenkinson, R. Daniel Mauldin, Mariusz Urbański · Ergodic Theory and Dynamical Systems · 2006
Let $X$ be a one-sided subshift of finite type on a countable alphabet, and $T:X\to X$ the shift map. If $f:X\to{\mathbb R}$ is continuous, we provide conditions guaranteeing that $f$ -maximizing measures exist, and are characterised by the condition that their support lies in a certain compact set.