Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Polynomial Carleson Operator

Published 19 May 2011 in math.CA | (1105.4504v3)

Abstract: We prove affirmatively the one dimensional case of a conjecture of Stein regarding the $Lp$-boundedness of the Polynomial Carleson operator, for $1<p<\infty$. The proof is based on two new ideas: i) developing a framework for \emph{higher-order wave-packet analysis} that is consistent with the time-frequency analysis of the (generalized) Carleson operator, and ii) a new tile discretization of the time-frequency plane that has the major consequence of \emph{eliminating the exceptional sets} from the analysis of the Carleson operator. As a further consequence, we are able to provide the full $Lp$ boundedness range and prove directly -- without interpolation techniques -- the strong $L2$ bound for the (generalized) Carleson operator, answering a question raised by C. Fefferman.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.