Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximizing measures for countable alphabet shifts via blur shift spaces

Published 24 Jul 2025 in math.DS | (2507.18736v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.