Related papers: Discrete analogues of Kakeya problems
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…
We study the Cauchy problem for one-dimensional dispersive equations posed on $\mathbb{R} $, under the hypotheses that the dispersive operator behaves, for high frequencies, as a Fourier multiplier by $ i |\xi|^\alpha \xi $ with $ 1 \le…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
We establish inequalities that constrain the genera of smooth cobordisms between knots in 4-dimensional cobordisms. These "relative adjunction inequalities" improve the adjunction inequalities for closed surfaces which have been…
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 develop both bilinear theory and commutator estimates in the context of entangled dilations, specifically Zygmund dilations $(x_1, x_2, x_3) \mapsto (\delta_1 x_1, \delta_2 x_2, \delta_1 \delta_2 x_3)$ in $\mathbb{R}^3$. We construct…
We consider singular quasilinear elliptic systems with homogeneous Dirichlet boundary condition. Using Leray-Schauder topological degree, combined with the sub-supersolutions method and suitable truncation arguments, we establish the…
We show that a certain conjectured optimal reverse Littlewood- Paley inequality would, if true, imply sharp results for the Kakeya maximal function, the Bochner-Riesz means and the Fourier restriction operator.
The physical 3d $\mathcal{N}=2$ theory T[Y] was previously used to predict the existence of some 3-manifold invariants $\hat{Z}_{a}(q)$ that take the form of power series with integer coefficients, converging in the unit disk. Their radial…
The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…
Guth and Katz proved that, as conjectured by Elekes and Sharir, $m$ lines in 3-space have at most constant times $ m^{3/2}$ intersection points, aside from some obvious counter examples. We give an explicit bound for the constant, using the…
In this paper we present a smallest possible counterexample to the Numerical Terao's Conjecture in the class of line arrangements in the complex projective plane. Our example consists of a pair of two arrangements with $13$ lines. Moreover,…
Many multilinear discrete operators are primed for pointwise decomposition; such decompositions give structural information but also an essentially optimal range of bounds. We study the (continuous) slicing method of Jeong and Lee -- which…
The approximate Carath\'eodory problem in general form is as follows: Given two symmetric convex bodies $P,Q \subseteq \mathbb{R}^m$, a parameter $k \in \mathbb{N}$ and $\mathbf{z} \in \textrm{conv}(X)$ with $X \subseteq P$, find…
Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimization of max-type functions, and simple composite…
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…
In this short note we apply a recent theorem of Koll\'ar about the arithmetic genus of curves to give a bound on the number of joints weighted by the multiplicities. This gives an affirmative answer to a conjecture of Carbery in the generic…
Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for combinatorial optimization problems. The class of approximate…
We study some arithmetic properties of the mirror maps and the quantum Yukawa coupling for some 1-parameter deformations of Calabi-Yau manifolds. First we use the Schwarzian differential equation, which we derived previously, to…
We consider Guth's approach to the Fourier restriction problem via polynomial partitioning. By writing out his induction argument as a recursive algorithm and introducing new geometric information, known as the polynomial Wolff axioms, we…