Related papers: A proof of hyperbolic van der Waerden conjecture :…

Nuij's theorem states that if a polynomial $p\in \mathbb{R}[z]$ is hyperbolic (i.e., has only real roots) then $p+sp'$ is also hyperbolic for any $s\in \mathbb{R}$. We study other perturbations of hyperbolic polynomials of the form…

In a recent breakthrough, Dimitrov solved the Schinzel-Zassenhaus Conjecture. We follow his approach and adapt it to certain dynamical systems arising from polynomials of the form $T^p+c$ where $p$ is a prime number and where the orbit of…

We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…

In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree $n$ in $n^2$ variables such that any homogeneous depth 4 arithmetic circuit…

The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has a monochromatic arithmetic progression of length k. The existence of such an n for any k is due to van der Waerden but known upper bounds…

In recent years, there has been a flurry of activity towards proving lower bounds for homogeneous depth-4 arithmetic circuits, which has brought us very close to statements that are known to imply $\textsf{VP} \neq \textsf{VNP}$. It is open…

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

A log generic hypersurface in $\mathbb{P}^n$ with respect to a birational modification of $\mathbb{P}^n$ is by definition the image of a generic element of a high power of an ample linear series on the modification. A log very-generic…

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

The set of homogeneous polynomials of degree $D$ is a topological space that contains the subspace $Hyp(D)$ constituted only by hyperbolic polynomials. In 2002, V. I. Arnold conjectured that the number of connected components of $Hyp (D)$…

Consider random polynomials of the form $G_n = \sum_{i=0}^n \xi_i p_i$, where the $\xi_i$ are i.i.d.\ non-degenerate complex random variables, and $\{p_i\}$ is a sequence of orthonormal polynomials with respect to a regular measure $\tau$…

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Let $A \in \Omega_n$ be doubly-stochastic $n \times n$ matrix. Alexander Schrijver proved in 1998 the following remarkable inequality per(\widetilde{A}) \geq \prod_{1 \leq i,j \leq n} (1- A(i,j)); \widetilde{A}(i,j) =: A(i,j)(1-A(i,j)), 1…

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…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

If all the zeros of $n$th degree polynomials $f(z)$ and $g(z) = \sum_{k=0}^{n}\lambda_k\binom{n}{k}z^k$ respectively lie in the cricular regions $|z|\leq r$ and $|z| \leq s|z-\sigma|$, $s>0$, then it was proved by Marden \cite[p. 86]{mm}…

We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite…