Sparse Bounds for Random Discrete Carleson Theorems
Ben Krause, Michael T. Lacey

TL;DR
This paper establishes sparse bounds and weighted estimates for discrete random variants of the Carleson maximal operator, revealing new insights into their boundedness and behavior in harmonic analysis.
Contribution
It introduces novel sparse bounds and weighted estimates for random discrete Carleson operators, extending understanding of their boundedness properties.
Findings
Almost sure boundedness from ^p to ^p for certain ^p spaces
Sparse bounds imply new weighted ^2 estimates
Boundedness depends on the Minkowski dimension of subset
Abstract
We study discrete random variants of the Carleson maximal operator. Intriguingly, these questions remain subtle and difficult, even in this setting. Let be an independent sequence of random variables with expectations \[ \mathbb E X_m = \sigma_m = m^{-\alpha}, \ 0 < \alpha < 1/2, \] and . Then the maximal operator below almost surely is bounded from to , provided the Minkowski dimension of is strictly less than . \[ \sup_{\lambda \in \Lambda } \Bigl| \sum_{m\neq 0} X_{\lvert m\rvert } \frac{e( \lambda m )}{ {\rm sgn} (m)S_{ |m| }} f(x- m) \Bigr|. \] This operator also satisfies a sparse type bound. The form of the sparse bound immediately implies weighted estimates in all , which are novel in this setting. Variants and extensions are also considered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Harmonic Analysis Research · Mathematical Approximation and Integration · Nonlinear Partial Differential Equations
