Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hickman et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: