Maximizing measures for countable alphabet shifts via blur shift spaces
Abstract: For upper semi-continuous potentials defined on shifts over countable alphabets, this paper ensures sufficient conditions for the existence of a maximizing measure. We resort to the concept of blur shift, introduced by T. Almeida and M. Sobottka as a compactification method for countable alphabet shifts consisting of adding new symbols given by blurred subsets of the alphabet. Our approach extends beyond the Markovian case to encompass more general countable alphabet shifts. In particular, we guarantee a convex characterization and compactness for the set of blur invariant probabilities with respect to the discontinuous shift map.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.