A proof of hyperbolic van der Waerden conjecture : the right generalization is the ultimate simplification

Consider a homogeneous polynomial $p(z_1,\mathrm{.}\mathrm{.}\mathrm{.},z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \ $\mathrm{\mid }p(z_1,\mathrm{.}\mathrm{.}\mathrm{.},z_n)\mathrm{\mid }\ge {\prod }_{1\le i\le n}Re(z_i)$ on the domain $\{(z_1,\mathrm{.}\mathrm{.}\mathrm{.},z_n):Re(z_i)\ge 0,1\le i\le n\}$ . \ We prove that $|\frac{\partial^n}{\partial z_1…\partial z_n} p | \geq \frac{n!}{n^n}$ . Our proof is relatively short and self-contained (i.e. we only use basic properties of hyperbolic polynomials). As the van der Waerden conjecture for permanents, proved by D.I. Falikman and G.P. Egorychev, as well Bapat’s conjecture for mixed discriminants, proved by the author, are particular cases of this result. We also prove so called “small rank” lower bound (in the permanents context it corresponds to sparse doubly-stochastic matrices, i.e. with small number of non-zero entries in each column). The later lower bound generalizes (with simpler proofs) recent lower bounds by A.Schrijver for the number of perfect matchings of $k$-regular bipartite graphs. We present some important algorithmic applications of the result, including a polynomial time deterministic algorithm approximating the permanent of $n \times n$nonnegativeentry-wisematriceswithinmultiplicativefactor$\frac{e^n}{n^m}$foranyfixedpositive$m$ .