Exponential sums with coefficients 0 or 1 and concentrated L^{p} norms

Mathematics – Classical Analysis and ODEs

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let f be a sum of exponentials of the form exp(2 pi i N x), where the N are distinct integers. We call f an idempotent trigonometric polynomial (because the convolution of f with itself is f) or, simply, an idempotent. We show that for every p > 1, and every set E of the torus T = R/Z with |E| > 0, there are idempotents concentrated on E in the Lp sense. More precisely, for each p > 1, there is an explicitly calculated constant Cp > 0 so that for each E with |E| > 0 and epsilon > 0 one can find an idempotent f such that the pth root of the ratio of the integral over E of the pth power of |f| to the integral over T of the pth power of |f| is greater than Cp - epsilon. This is in fact a lower bound result and, though not optimal, it is close to the best that our method gives. We also give both heuristic and computational evidence for the still open problem of whether the Lp concentration phenomenon fails to occur when p = 1.

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

Exponential sums with coefficients 0 or 1 and concentrated L^{p} norms 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 Exponential sums with coefficients 0 or 1 and concentrated L^{p} norms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential sums with coefficients 0 or 1 and concentrated L^{p} norms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-616076

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