Hostname: page-component-74656f9884-7drmj Total loading time: 0 Render date: 2026-11-05T08:33:25.181Z Has data issue: false hasContentIssue false

Maximizing measures for countable alphabet shifts via blur shift spaces

Published online by Cambridge University Press:  22 January 2026

EDUARDO GARIBALDI
Affiliation:
Institute of Mathematics, Statistics and Scientific Computing, University of Campinas , Campinas, 13083-859 SP, Brazil (e-mail: garibaldi@ime.unicamp.br)
JOÃO TIAGO ASSUNÇÃO GOMES*
Affiliation:
Center of Exact and Technological Sciences, Federal University of Recôncavo da Bahia , Cruz das Almas, 44380-000 BA, Brazil
MARCELO SOBOTTKA
Affiliation:
Department of Mathematics, Federal University of Santa Catarina , Florianópolis, 88040-900 SC, Brazil (e-mail: marcelo.sobottka@ufsc.br)
Rights & Permissions [Opens in a new window]

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.

Information

Type
Original Article
Copyright
© The Author(s), 2026. Published by Cambridge University Press
Figure 0

Figure 1 Graphical representations of convex decompositions of the set of $ \hat {\sigma } $-invariant measures for blur shifts with one-symbol and three-symbol resolutions.

Figure 1

Figure 2 Graph representation of conditions (C2) and (C3) in Definition 7.1.