For intrinsically ergodic non-Markov subshifts over finite alphabets, continuous functions split into a Gδ-dense set with low-entropy maximizers and a set whose closure includes functions with uncountably many fully supported high-entropy ergodic maximizers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ergodic optimization for continuous functions on non-Markov shifts
For intrinsically ergodic non-Markov subshifts over finite alphabets, continuous functions split into a Gδ-dense set with low-entropy maximizers and a set whose closure includes functions with uncountably many fully supported high-entropy ergodic maximizers.