Related papers: Extensions to the Method of Multiplicities, with a…

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

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…

Let $\mathbb{F}$ be a finite field consisting of $q$ elements and let $n \geq 1$ be an integer. In this paper, we study the size of local Kakeya sets with respect to subsets of $\mathbb{F}^{n}$ and obtain upper and lower bounds for the…

We show that a randomly chosen linear map over a finite field gives a good hash function in the $\ell_\infty$ sense. More concretely, consider a set $S \subset \mathbb{F}_q^n$ and a randomly chosen linear map $L : \mathbb{F}_q^n \to…

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 the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a…

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…

Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f, and that…

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…

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens…

We investigate optimal expansions of Kakeya sequences for the representation of real numbers. Expansions of Kakeya sequences generalize the expansions in non-integer bases and they display analogous redundancy phenomena. In this paper, we…

The Kakeya conjecture is generally formulated as one the following statements: every compact/Borel/arbitrary subset of ${\mathbb R}^n$ that contains a (unit) line segment in every direction has Hausdorff dimension $n$; or, sometimes, that…

We prove the discrete analogue of Kakeya conjecture over $\mathbb{R}^n$. This result suggests that a (hypothetically) low dimensional Kakeya set cannot be constructed directly from discrete configurations. We also prove a generalization…

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…

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…

I show that $L^{p}-L^{q}$ estimates for the Kakeya maximal function yield lower bounds for the conformal dimension of Kakeya sets, and upper bounds for how much quasisymmetries can increase the Hausdorff dimension of line segments inside…

Many natural notions of additive and multiplicative largeness arise from results in Ramsey theory. In this paper, we explain the relationships between these notions for subsets of $\mathbb{N}$ and in more general ring-theoretic structures.…

Using the polynomial method of Dvir \cite{dvir}, we establish optimal estimates for Kakeya sets and Kakeya maximal functions associated to algebraic varieties $W$ over finite fields $F$. For instance, given an $n-1$-dimensional projective…

The multiplicity Schwartz-Zippel lemma asserts that over a field, a low-degree polynomial cannot vanish with high multiplicity very often on a sufficiently large product set. Since its discovery in a work of Dvir, Kopparty, Saraf and Sudan…