Uniform ergodic theorems on subshifts over a finite alphabet
Daniel Lenz
Abstract
We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive functions. We then give a necessary and sufficient condition on a minimal subshift to allow for a uniform subadditive ergodic theorem. This provides in particular a sufficient condition for unique ergodicity.
Create a lesson
Related papers
ω-limit sets of triangular maps over periodic orbits of the base
Juan Luis García Guirao
The full Kolakoski shift is topologically transitive
Andrew C. Mitchell, James J. Walton, Michael F. Whittaker
Delay-induced multirhythmicity in a 3-cell inhibitory network
Xinxin Qie, Morten Gram Pedersen, Jian Song et al.
Natural Expansiveness and Equilibrium States for Semiflows
Nelda Tamblay, Juan Francisco Peña
Largest-Angle Bisection and Statistical Regularization of Triangle Shapes
Jérôme Michaud
Planar Central Configurations of Four Equal Masses: Classification and Morse Indices
Xiaoxiang Huangfu, Huatong Shen