Related papers: Improved bounds for the Kakeya maximal conjecture …
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…
Directed and undirected graphical models, also called Bayesian networks and Markov random fields, respectively, are important statistical tools in a wide variety of fields, ranging from computational biology to probabilistic artificial…
We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…
The Fourier restriction conjecture is a fundamental problem in harmonic analysis. In this paper, we investigate restriction estimates for degenerate higher codimensional quadratic surfaces and obtain sharp results for some types of…
We construct a non-proper set of two variables polynomial maps and study the nowhere vanishing Jacobian condition of the Jacobian conjecture for this set. We obtain some classes of polynomial maps satisfying the 2-dimensional Jacobian…
One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…
We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…
We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…
We provide a condition on a set of directions $\Omega \subset \mathbb{S}^1$ ensuring that the associated directional maximal operator $M_\Omega$ is unbounded on $L^p(\mathbb{R}^2)$ for every $1 \leq p < \infty$. The techniques of proof…
Finding a good bound on the maximal edge diameter $\Delta(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known,…
The Multiplicity Conjecture is a deep problem relating the multiplicity (or degree) of a Cohen-Macaulay standard graded algebra with certain extremal graded Betti numbers in its minimal free resolution. In the case of level algebras of…
We consider a linearised inverse conductivity problem for electromagnetic waves in a three dimensional bounded domain at a high time-harmonic frequency. Increasing stability bounds for the conductivity coefficient in the full Maxwell system…
We compare the smooth Alpert testing condition for the paraboloid Fourier extension conjecture in <cite>RiSa3</cite> to the modulated testing condition for the Kakeya conjecture in <cite>RiSa2</cite>. To this end, the modulated testing…
For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…
We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
This dissertation studies the Fourier restriction, which is to find the range of the constants p, q such that the L^q norm on a chosen subset of the Fourier domain is bounded above by the L^p norm in a spacial domain, up to some constant…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…