Approximation of the Stability Number of a Graph via Copositive Programming
SIAM Journal on Optimization
On the complexity of Schmüdgen's positivstellensatz
Journal of Complexity
Optimization of Polynomials on Compact Semialgebraic Sets
SIAM Journal on Optimization
Effective Pólya semi-positivity for non-negative polynomials on the simplex
Journal of Complexity
A quantitative Pólya's Theorem with zeros
Journal of Symbolic Computation
Journal of Symbolic Computation
Hi-index | 0.00 |
Pólya's Theorem says that if p is a homogeneous polynomial in n variables which is positive on the standard n-simplex, and F is the sum of the variables, then for a sufficiently large exponent N, FN * p has positive coefficients. Pólya's Theorem has had many applications in both pure and applied mathematics; for example it provides a certificate for the positivity of p on the simplex. The authors have previously given an explicit bound on N, determined by the data of p; namely, the degree, the size of the coefficients and the minimum value of p on the simplex. In this paper, we extend this quantitative Pólya's Theorem to non-negative polynomials which are allowed to have simple zeros at the corners of the simplex.