Gurvits's inner-product conjecture for homogeneous real stable polynomials

At least 7 years old · documented by

Let p,q∈R+[x1,…,xn]p,q \in \mathbb{R}_+[x_1,\ldots,x_n] be homogeneous real stable polynomials of total degree dd. For a multi-index μ\mu with ∣μ∣=d|\mu|=d, write pμp_\mu and qμq_\mu for the corresponding coefficients, let (dμ)\binom{d}{\mu} denote the multinomial coefficient, and let αα=∏i=1nαiαi\alpha^\alpha=\prod_{i=1}^n\alpha_i^{\alpha_i}. For a polynomial ff, define its capacity by Cap⁡α(f)=inf⁡xi>0f(x1,…,xn)/(x1α1⋯xnαn)\operatorname{Cap}_\alpha(f)=\inf_{x_i>0}f(x_1,\ldots,x_n)/(x_1^{\alpha_1}\cdots x_n^{\alpha_n}). Gurvits's conjecture.

∑∣μ∣=d(dμ)−1pμqμ≥ααddCap⁡α(p)Cap⁡α(q).\sum_{|\mu|=d}\binom{d}{\mu}^{-1}p_\mu q_\mu\geq\frac{\alpha^\alpha}{d^d}\operatorname{Cap}_\alpha(p)\operatorname{Cap}_\alpha(q).

This conjecture seeks an inner-product lower bound for homogeneous real stable polynomials in terms of their capacities, extending capacity inequalities connected with stable polynomials and strong Rayleigh measures. The source does not state a resolution, so its status remains open.

References

Primary source

Leonid Gurvits and Jonathan Leake, “Counting Matchings via Capacity Preserving Operators”, arXiv:1804.04351 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.