2000 character limit reached
Improved Fourier restriction estimates in higher dimensions
Published 28 Jul 2018 in math.CA | (1807.10940v3)
Abstract: We consider Guth's approach to the Fourier restriction problem via polynomial partitioning. By writing out his induction argument as a recursive algorithm and introducing new geometric information, known as the polynomial Wolff axioms, we obtain improved bounds for the restriction conjecture, particularly in high dimensions. Consequences for the Kakeya conjecture are also considered.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.