Papers
Topics
Authors
Recent
2000 character limit reached

Improved bounds for the Kakeya maximal conjecture in higher dimensions (1908.05589v1)

Published 14 Aug 2019 in math.CA and math.MG

Abstract: We adapt Guth's polynomial partitioning argument for the Fourier restriction problem to the context of the Kakeya problem. By writing out the induction argument as a recursive algorithm, additional multiscale geometric information is made available. To take advantage of this, we prove that direction-separated tubes satisfy a multiscale version of the polynomial Wolff axioms. Altogether, this yields improved bounds for the Kakeya maximal conjecture in $\mathbb{R}n$ with $n=5$ or $n\ge 7$ and improved bounds for the Kakeya set conjecture for an infinite sequence of dimensions.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

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.

Collections

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