Recognition: unknown
Uniform ergodic theorems on subshifts over a finite alphabet
classification
🧮 math.DS
math-phmath.MP
keywords
ergodicuniformsubshiftadditivealphabetconditionfinitefunctions
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.