Maximal operators and differentiation theorems for sparse sets

Mathematics – Classical Analysis and ODEs

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revised version. The final version will appear in Duke Math. J

Scientific paper

We study maximal averages associated with singular measures on $\rr$. Our main result is a construction of singular Cantor-type measures supported on sets of Hausdorff dimension $1 - \epsilon$, $0 \leq \epsilon < {1/3}$ for which the corresponding maximal operators are bounded on $L^p(\mathbb R)$ for $p > (1 + \epsilon)/(1 - \epsilon)$. As a consequence, we are able to answer a question of Aversa and Preiss on density and differentiation theorems in one dimension. Our proof combines probabilistic techniques with the methods developed in multidimensional Euclidean harmonic analysis, in particular there are strong similarities to Bourgain's proof of the circular maximal theorem in two dimensions. Updates: Andreas Seeger has provided an argument to the effect that our global maximal operators are in fact bounded on L^p(R) for all p>1; in particular, it follows that our differentiation theorems are also valid for all p>1. Furthermore, David Preiss has proved that no such differentiation theorems (let alone maximal estimates) can hold with p=1. These arguments are included in the new version. We have also improved the exposition in a number of places.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Maximal operators and differentiation theorems for sparse sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximal operators and differentiation theorems for sparse sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal operators and differentiation theorems for sparse sets will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-708374

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.