Related papers: Improved bounds for the Kakeya maximal conjecture …
We prove that every Kakeya set in $\mathbb{R}^3$ formed from lines of the form $(a,b,0) + \operatorname{span}(c,d,1)$ with $ad-bc=1$ must have Hausdorff dimension $3$; Kakeya sets of this type are called $SL_2$ Kakeya sets. This result was…
A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the…
The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\dots,k_n$ can be encoded as the vertices of the partition polytope $\mathrm{PP}(k_1,\dots,k_n)$. We prove that, if $K = \max\{k_1,\dots,k_n\}$, then the…
Finding vacua of supergravity theories is an outstanding problem which has been tackled in several ways, and with this work we add a new method to the puzzle. We analyse the scalar sector of maximal gauged supergravity theories in seven…
Okuyama introduced a family of polynomials, whose coefficients depend on a parameter $q$, in his study of correlators in the double-scaled SYK model. He verified in small cases that their coefficients can be expressed in terms of certain…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
A Kakeya set contains a line in each direction. Dvir proved a lower bound on the size of any Kakeya set in a finite field using the polynomial method. We prove analogues of Dvir's result for non-degenerate conics, that is, parabolae and…
We prove that the largest convex shape that can be placed inside a given convex shape $Q \subset \mathbb{R}^{d}$ in any desired orientation is the largest inscribed ball of $Q$. The statement is true both when "largest" means "largest…
We give new improved bounds for the dominant dimension of Nakayama algebras and use those bounds to give a classification of Nakayama algebras with $n$ simple modules that are higher Auslander algebras with global dimension at least $n$.…
We give improved lower bounds on the size of Kakeya and Nikodym sets over $\mathbb{F}_q^3$. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in $\mathbb{F}_q^3$, and show that…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…
We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and…
We give a proof of Fourier extension conjecture on the paraboloid in all dimensions bigger than 2 that begins with a decomposition suggested in Sawyer [Saw8] of writing a smooth Alpert projection as a sum of pieces whose Fourier extensions…
A (d,k) set is a subset of R^d containing a translate of every k-dimensional plane. Bourgain showed that for 2^{k-1}+k \geq d, every (d,k) set has positive Lebesgue measure. We give an L^p bound for the corresponding maximal operator.
We prove upper and lower bounds for leading coefficient of Kolchin dimension polynomial of systems of partial linear differential equations in codimension two.
We consider (bounded) Besicovitch sets in the Heisenberg group and prove that $L^p$ estimates for the Kakeya maximal function imply lower bounds for their Heisenberg Hausdorff dimension.
Following the ideas from a paper by the same author, we prove abstract maximal restriction results for the Fourier transform. Our results deal mainly with maximal operators of convolution-type and $r-$average maximal functions. As a…
In this paper, we prove that the Fourier entropy of an $n$-dimensional boolean function $f$ can be upper-bounded by $O(I(f)+ \sum\limits_{k\in[n]}I_k(f)\log \frac{1}{I_k(f)})$, where $I(f)$ is its total influence and $I_k(f)$ is the…
It is shown that $SL_2$ Besicovitch sets of measure zero exist in $\mathbb{R}^3$. The proof is constructive and uses point-line duality analogously to Kahane's construction of measure zero Besicovitch sets in the plane. A corollary is that…