An L¹ Ergodic Theorem for Sparse Random Subsequences
classification
🧮 math.DS
keywords
ergodicproverandomsequencessparsetheoremcertainchosen
read the original abstract
We prove an L^1 subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L^1-good sequences nearly as sparse as the set of squares. In the process, we prove that a certain deterministic condition implies a weak maximal inequality for a sequence of \ell^1 convolution operators.
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.