Related papers: Lower Bounds on the Bounded Coefficient Complexity…
We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…
We prove strengthened lower bounds for constant-depth set-multilinear formulas. More precisely, we show that over any field, there is an explicit polynomial $f$ in VNP defined over $n^2$ variables, and of degree $n$, such that any…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
The last five years of research on distributed graph algorithms have seen huge leaps of progress, both regarding algorithmic improvements and impossibility results: new strong lower bounds have emerged for many central problems and…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…
We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two $n \cross n$ matrices over finite fields. In particular we obtain the following results: 1. We show that the number of…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…
We develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broadcast an O(log n)-sized message to all other processors). Our…
The following notion of growth rate can be seen as a generalization of joint spectral radius: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ with nonnegative coefficients and a nonnegative vector $s\in\mathbb R^d$,…
We study continuous quadratic submodular minimization with bounds and propose a polynomially sized semidefinite relaxation, which is provably tight for dimension $n \le 3$ and empirically tight for larger $n$. We apply the relaxation to two…
In this paper, we present a novel approach to the problem of merging of B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for…
This work is devoted to studying the boundedness on Lebesgue spaces of bilinear multipliers on $\R$ whose symbol is narrowly supported around a curve (in the frequency plane). We are looking for the optimal decay rate (depending on the…
We establish tight bounds for beacon-based coverage problems, and improve the bounds for beacon-based routing problems in simple rectilinear polygons. Specifically, we show that $\lfloor \frac{n}{6} \rfloor$ beacons are always sufficient…
We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…
We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…