The optimality conjecture for the hyperbolic-polynomial approximation factor

From papers

Let PHYP(n,m)PHYP(n,m) be the set of positive hyperbolic polynomials of degree mm in nn variables, let Sn,nmS_{n,n-m} be the polynomial used in the source, and let Cap\operatorname{Cap} denote capacity. Define

γ(n,m)=infrUPHYP(n,nm)supqPHYP(n,m)Cap(qr)nx1xnq(0,,0)r(0,,0).\gamma(n,m)=\inf_{r\in UPHYP(n,n-m)}\sup_{q\in PHYP(n,m)}\frac{\operatorname{Cap}(qr)}{\frac{\partial^n}{\partial x_1\cdots\partial x_n}q(0,\ldots,0)r(0,\ldots,0)}.

The optimality conjecture. The particular polynomial Sn,nmS_{n,n-m} is optimal in the sense that

γ(n,m)=supqPHYP(n,m)Cap(qSn,nm)nx1xnq(0)Sn,nm(0)=nmm!.\gamma(n,m)=\sup_{q\in PHYP(n,m)}\frac{\operatorname{Cap}(qS_{n,n-m})}{\frac{\partial^n}{\partial x_1\cdots\partial x_n}q(0)S_{n,n-m}(0)}=\frac{n^m}{m!}.

The preceding discussion establishes the lower bound γ(n,m)nm/m!\gamma(n,m)\geq n^m/m!; the displayed equality would identify the exact approximation factor for the chosen class of positive hyperbolic polynomials. The source does not provide a resolution.

Progress summary

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

Sources & referencesView supporting material

Primary source

Shmuel Friedland and Leonid Gurvits, “Generalized Friedland-Tverberg inequality: applications and extensions”, arXiv:math/0603410 (2006).

Solutions 0

No solutions have been posted yet.