$L^2$ Bounds for a maximal directional Hilbert transform
Jongchon Kim, Malabika Pramanik

TL;DR
This paper establishes nearly optimal uniform $L^2$ bounds for the maximal directional Hilbert transform in higher dimensions, using polynomial partitioning and orthogonality techniques, with applications to specific direction sets.
Contribution
It provides the first sharp uniform $L^2$ bounds for $H_{oldsymbol{ ext{Omega}}}$ in dimensions 3 and higher, employing polynomial partitioning and an almost-orthogonality principle.
Findings
Established sharp $L^2$ bounds depending only on $N$ for the maximal directional Hilbert transform.
Developed an almost-orthogonality principle applicable to specific direction sets.
Derived stronger $L^2$ estimates for particular direction sets using the new principle.
Abstract
Given any finite direction set of cardinality in Euclidean space, we consider the maximal directional Hilbert transform associated to this direction set. Our main result provides an essentially sharp uniform bound, depending only on , for the operator norm of in dimensions 3 and higher. The main ingredients of the proof consist of polynomial partitioning tools from incidence geometry and an almost-orthogonality principle for . The latter principle can also be used to analyze special direction sets , and derive sharp estimates for the corresponding operator that are typically stronger than the uniform bound mentioned above. A number of such examples are discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
