Sparse Bounds for Random Discrete Carleson Theorems

preprint2016arXivOpen access

Abstract

We study discrete random variants of the Carleson maximal operator. Intriguingly, these questions remain subtle and difficult, even in this setting. Let {Xm}\{X_m\} be an independent sequence of {0,1}\{0,1\} random variables with expectations EXm=σm=m−α, 0<α<1/2, \mathbb E X_m = σ_m = m^{-α}, \ 0 < α< 1/2, and Sm=∑k=1mXk S_m = \sum_{k=1} ^{m} X_k. Then the maximal operator below almost surely is bounded from ℓp \ell ^{p} to ℓp \ell ^{p}, provided the Minkowski dimension of Λ⊂[−1/2,1/2] Λ\subset [-1/2, 1/2] is strictly less than 1−α 1- α. sup⁡λ∈Λ∣∑m≠0X∣m∣e(λm)sgn(m)S∣m∣f(x−m)∣. \sup_{λ\in Λ} \Bigl| \sum_{m\neq 0} X_{\lvert m\rvert } \frac{e( λ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 ℓ2 \ell ^{2}, which are novel in this setting. Variants and extensions are also considered.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.