On multivariate Newton-like inequalities
Leonid Gurvits

TL;DR
This paper introduces a class of multivariate entire functions called Strongly Log-Concave, generalizes Newton inequalities to this class, and shows their support sets are discretely convex, with proofs based on convex relaxations and bounds related to the Van Der Waerden inequality.
Contribution
It defines Strongly Log-Concave functions, extends Newton inequalities to multivariate cases, and links support convexity to these inequalities, providing new theoretical insights.
Findings
Strongly Log-Concave functions generalize Minkowski volume polynomials.
Multivariate Newton-like inequalities are established for this class.
Support of such functions is proven to be discretely convex.
Abstract
We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function in variables is called {\bf Strongly Log-Concave} if the function is either zero or is concave on . We start with yet another point of view (via {\it propagation}) on the standard univarite (or homogeneous bivariate) {\bf Newton Inequlities}. We prove analogues of (univariate) {\bf Newton Inequlities} in the (multivariate) {\bf Strongly Log-Concave} case. One of the corollaries of our new Newton(like) inequalities is the fact that the support of a {\bf Strongly Log-Concave} entire function is discretely convex (-convex in our…
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
TopicsStatistical and numerical algorithms · Probabilistic and Robust Engineering Design · Mathematical Inequalities and Applications
