Related papers: Generalized Arithmetic Kakeya
The arithmetic Kakeya conjecture, formulated by Katz and Tao in 2002, is a statement about addition of finite sets. It is known to imply a form of the Kakeya conjecture, namely that the upper Minkowski dimension of a Besicovitch set in…
In this dissertation we define a generalization of Kakeya sets in certain metric spaces. Kakeya sets in Euclidean spaces are sets of zero Lebesgue measure containing a segment of length one in every direction. A famous conjecture, known as…
Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…
A Kakeya set is a compact subset of $\mathbb{R}^n$ that contains a unit line segment pointing in every direction. The Kakeya conjecture asserts that such sets must have Hausdorff and Minkowski dimension $n$. There is a special class of…
We prove the Kakeya set conjecture for $\mathbb{Z}/N\mathbb{Z}$ for general $N$ as stated by Hickman and Wright [HW18]. This entails extending and combining the techniques of Arsovski [Ars21a] for $N=p^k$ and the author and Dvir [DD21] for…
We study a variety of problems about homothets of sets related to the Kakeya conjecture. In particular, we show many of these problems are equivalent to the arithmetic Kakeya conjecture of Katz and Tao. We also provide a proof that the…
The restriction and Kakeya problems in Euclidean space have received much attention in the last few decades, and are related to many problems in harmonic analysis, PDE, and number theory. In this paper we initiate the study of these…
We prove that all bounded subsets of $\mathbb{Q}_p^n$ containing a line segment of unit length in every direction have Hausdorff and Minkowski dimension $n$. This is the analogue of the classical Kakeya conjecture with $\mathbb{R}$ replaced…
We derive Maximal Kakeya estimates for functions over $\mathbb{Z}/N\mathbb{Z}$ proving the Maximal Kakeya conjecture for $\mathbb{Z}/N\mathbb{Z}$ for general $N$ as stated by Hickman and Wright [HW18]. The proof involves using polynomial…
Roughly speaking, the Kakeya Conjecture asks to what extent lines which point in different directions can be packed together in a small space. In $\R^2$, the problem is relatively straightforward and was settled in the 1970s. In $\R^3$ it…
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…
We survey progress on the Kakeya conjecture in Euclidean space, with an emphasis on developments that have occurred since the previous surveys by Wolff and Katz-Tao.
As a discrete counterpart to the classical John theorem on the approximation of (symmetric) $n$-dimensional convex bodies $K$ by ellipsoids, Tao and Vu introduced so called generalized arithmetic progressions $P(A,b)\subset Z^n$ in order to…
A Besicovitch set is a subset of $\R^d$ that contains a unit line segment in every direction and the famous Kakeya conjecture states that Besicovitch sets should have full dimension. We provide a number of results in support of this…
Recently, Hong Wang and Joshua Zahl announced a proof of the 3-dimensional Kakeya conjecture. This is a survey article on the proof of Kakeya. We introduce the problem, discuss previous work and some of the difficulties of the problem, and…
Bennett, Carbery, and Tao formulated an n-linear analogue of the Kakeya conjecture in R^n. They proved the conjecture except for the endpoint case. We prove the endpoint case.
This paper presents several new results related to the Kakeya problem. First, we establish a geometric inequality which says that collections of direction-separated tubes (thin neighborhoods of line segments that point in different…
We obtain new bounds for the Kakeya maximal conjecture in most dimensions $n<100$, as well as improved bounds for the Kakeya set conjecture when $n=7$ or $9$. For this we consider Guth and Zahl's strengthened formulation of the maximal…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…