A recursive bound for a Kakeya-type maximal operator

Mathematics – Classical Analysis and ODEs

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages, no figures

Scientific paper

A (d,k) set is a subset of R^d containing a translate of every k-dimensional
plane. Bourgain showed that for 2^{k-1}+k \geq d, every (d,k) set has positive
Lebesgue measure. We give an L^p bound for the corresponding maximal operator.

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

A recursive bound for a Kakeya-type maximal operator 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 A recursive bound for a Kakeya-type maximal operator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A recursive bound for a Kakeya-type maximal operator will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-613173

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