Related papers: The Kakeya Conjecture: where does it come from 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.
In 1966, T. Gallai asked whether every connected graph has a vertex that appears in all longest paths. Since then this question has attracted much attention and many work has been done in this topic. One important open question in this area…
Karasev conjectured that for any set of $3k$ lines in general position in the plane, which is partitioned into $3$ color classes of equal size $k$, the set can be partitioned into $k$ colorful 3-subsets such that all the triangles formed by…
A two-dimensional Besicovitch set over a finite field is a subset of the finite plane containing a line in each direction. In this paper, we conjecture a sharp lower bound for the size of such a subset and prove some results toward this…
This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information about the fiber label in a fibered geometric set, how much…
We prove a theorem on the extension of holomorphic sections of powers of adjoint bundles from submanifolds of complex codimension 1 having non-trivial normal bundle. The first such result, due to Takayama, considers the case where the…
For a finite field GF(q) a Kakeya set K is a subset of GF(q)^n that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.
A famous conjecture attributed to Kodaira asks whether any compact Kaehler manifold can be approximated by projective manifolds. We confirm this conjecture on projectivized direct sums of three line bundles on three-dimensional complex tori…
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…
We deduce the Kazhdan-Lusztig conjecture on the multiplicities of simple modules over a simple complex Lie algebra in Verma modules in category O from the equivariant geometric Satake correspondence and the analysis of torus fixed points in…
In a recent paper [Ann. of Math. 189 (2019), 837--861], Du and Zhang proved a fractal Fourier restriction estimate and used it to establish the sharp $L^2$ estimate on the Schr\"{o}dinger maximal function in $\Bbb R^n$, $n \geq 2$. In this…
A Kakeya set $\mathcal{K}$ in an affine plane of order $q$ is the point set covered by a set $\mathcal{L}$ of $q+1$ pairwise non-parallel lines. Large Kakeya sets were studied by Dover and Mellinger; in [6] they showed that Kakeya sets with…
The purpose of these notes is describe the state of progress on the restriction problem in harmonic analysis, with an emphasis on the developments of the past decade or so on the Euclidean space version of these problems for spheres and…
An old conjecture of Kahn and Saks says, roughly, that any poset $P$ of large enough width contains elements $x,y$ which are "balanced" in the sense that the probability that $x$ precedes $y$ in a uniformly random linear extension of $P$ is…
This paper studies the structure of Kakeya sets in $\mathbb{R}^3$. We show that for every Kakeya set $K\subset\mathbb{R}^3$, there exist well-separated scales $0<\delta<\rho\leq 1$ so that the $\delta$ neighborhood of $K$ is almost as large…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
We construct a union of N parallelograms of dimensions approximately 1/N x 1 in the plane, with the slope of their long sides in the standard Cantor set. The union has area 1/log N but the union of the doubles has area log log N/ log N. In…
We propose an algebraic geometry framework for the Kakeya problem. We conjecture that for any polynomials $f,g\in\F_{q_0}[x,y]$ and any $\F_q/\F_{q_0}$, the image of the map $\F_q^3\to\F_q^3$ given by $(s,x,y)\mapsto…
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…
In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…