Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantitative Convergence for Sparse Ergodic Averages in $L^1$

Published 16 Apr 2025 in math.DS, math.CA, math.NT, and math.PR | (2504.12510v1)

Abstract: We provide a unified framework to proving pointwise convergence of sparse sequences, deterministic and random, at the $L1(X)$ endpoint. Specifically, suppose that [ a_n \in { \lfloor nc \rfloor, \min{ k : \sum_{j \leq k} X_j = n} } ] where $X_j$ are Bernoulli random variables with expectations $\mathbb{E} X_j = n{-\alpha}$, and we restrict to $1 < c < 8/7, \ 0 < \alpha < 1/2$. Then (almost surely) for any measure-preserving system, $(X,\mu,T)$, and any $f \in L1(X)$, the ergodic averages [ \frac{1}{N} \sum_{n \leq N} T{a_n} f ] converge $\mu$-a.e. Moreover, our proof gives new quantitative estimates on the rate of convergence, using jump-counting/variation/oscillation technology, pioneered by Bourgain. This improves on previous work of Urban-Zienkiewicz, and Mirek, who established the above with $c = \frac{1001}{1000}, \ \frac{30}{29}$, respectively, and LaVictoire, who established the random result, all in a non-quantitative setting.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.