arXiv · math/0005067
Uniform ergodic theorems on subshifts over a finite alphabet
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.
Explore related subjects
Keep this discovery
Daniel Lenz. 2000-05-07. Uniform ergodic theorems on subshifts over a finite alphabet. https://arxiv.org/abs/math/0005067
Cite the original work for its findings. Save a collection to share your selection of sources.