Related papers: A Quadratic Lower Bound for Algebraic Branching Pr…

We characterize the monotone bounded depth formula complexity for graph homomorphism and colored isomorphism polynomials using a graph parameter called the cost of bounded product depth baggy elimination tree. Using this characterization,…

In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…

The System of Linear Equations Problem (SLEP) is specified by a complex invertible matrix $A$, the condition number $\kappa$ of $A$, a vector $b$, a Hermitian matrix $M$ and an accuracy $\epsilon$, and the task is to estimate $x^\dagger…

The concept of \emph{data depth} in non-parametric multivariate descriptive statistics is the generalization of the univariate rank method to multivariate data. \emph{Halfspace depth} is a measure of data depth. Given a set $S$ of points…

We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…

We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi, where the circuits comprising the proof come from various restricted algebraic…

We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even $n$ and every integer $k\geq 1$, we show that under the constraint $\sum_{i=1}^n a_i^2=1$ the global minimum of the even-degree polynomial…

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

The best known size lower bounds against unrestricted circuits have remained around $3n$ for several decades. Moreover, the only known technique for proving lower bounds in this model, gate elimination, is inherently limited to proving…

A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $n \Delta$ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, $n$ is the…

We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in n^(lg^2 n) time. Further, our algorithm is oblivious to the order of the variables. This is…

We consider asymptotically flat Riemannian manifolds with nonnegative scalar curvature that are conformal to $\R^{n}\setminus \Omega, n\ge 3$, and so that their boundary is a minimal hypersurface. (Here, $\Omega\subset \R^{n}$ is open…

Consider a system of $m$ polynomial equations $\{p_i(x) = b_i\}_{i \leq m}$ of degree $D\geq 2$ in $n$-dimensional variable $x \in \mathbb{R}^n$ such that each coefficient of every $p_i$ and $b_i$s are chosen at random and independently…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

The (extended) Binary Value Principle (eBVP: $\sum_{i=1}^n x_i2^{i-1} = -k$ for $k>0$ and $x^2_i=x_i$) has received a lot of attention recently, several lower bounds have been proved for it (Alekseev et al 2020, Alekseev 2021, Part and…

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of $n \times n$ square matrices combining ``\emph{Strassen-like}'' fast matrix multiplication approach with…

In this paper we will give an account of Dan's reduction method for reducing the weight $ n $ multiple logarithm $ I_{1,1,\ldots,1}(x_1, x_2, \ldots, x_n) $ to an explicit sum of lower depth multiple polylogarithms in $ \leq n - 2 $…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…