Unharnessing the power of Schrijver’s permanental inequality

Let $A \in \Omega_n$ be doubly-stochastic $n \times n$ matrix. Alexander Schrijver proved in 1998 the following remarkable inequality \begin{equation} \label{le} 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 \leq i,j \leq n \end{equation} We prove in this paper the following generalization (or just clever reformulation) of (\ref{le}):\\ For all … Read more

On Newton(like) inequalities for multivariate homogeneous polynomials

Let $p(x_1,…,x_m) = \sum_{r_1 + \cdots + r_m = n} a_{r_1,…,r_m} \prod_{1 \leq i \leq m } x_i^{r_{i}}$ be a homogeneous polynomial of degree $n$ in $m$ variables. We call such polynomial {\bf H-Stable} if $p(z_1,…,z_m) \neq 0$ provided that the real parts $Re(z_i) > 0: 1 \leq i \leq m$. It can be assumed … Read more

Polynomial time algorithms to approximate mixed volumes within a simply exponential factor

We study in this paper randomized algorithms to approximate the mixed volume of well-presented convex compact sets. Our main result is a randomized poly-time algorithm which approximates $V(K_1,…,K_n)$ with multiplicative error $e^n$ and with better rates if the affine dimensions of most of the sets $K_i$ are small.\\ Even such rate is impossible to achieve … Read more

Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures :\

The paper describes various combinatorial and algorithmic applications of hyperbolic (multivariate) polynomials . Section 2.2 introduces a new class of polynomials , which include as hyperbolic polynomials as well volume polynomials $Vol(x_1C_1+…+x_nC_n)$ , where $C_i$ are convex compact subsets of $R^n$. This extension leads to randomized poly-time algorithm to approximate $M(C_1,…,C_n)$ (the mixed volume) within … Read more