Sharp inequalities for symmetric polynomials, Hunter's conjecture, and moments of exponential random variables
Silouanos Brazitikos, Christos Pandis

TL;DR
This paper proves Hunter's conjecture on symmetric polynomials, establishes sharp bounds for moments of sums of exponential variables, and derives norm inequalities, combining algebraic, probabilistic, and combinatorial methods.
Contribution
It confirms Hunter's conjecture, provides explicit minimizers and closed-form values for symmetric polynomials, and introduces new bounds for exponential moments and matrix norms.
Findings
Proved Hunter's conjecture for even-degree symmetric polynomials.
Derived exact minimizers and closed-form minimal values.
Established sharp bounds for exponential sum moments and matrix norms.
Abstract
We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even and every integer , we show that under the constraint the global minimum of the even-degree polynomial is attained precisely at the half-plus/half-minus vector and we compute the optimal value in closed form. The proof combines algebraic properties of with the probabilistic representation , where are i.i.d. standard exponential random variables with density and a combinatorial identity. This viewpoint further yields sharp upper and lower bounds for under natural constraints on the coefficients, including the spherical constraint combined with the non-negative regime , or the centred regime $\sum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Geometry and complex manifolds · Mathematical functions and polynomials
