A quantitative Pólya's theorem with zeros
From MaRDI portal
Publication:1030259
DOI10.1016/j.jsc.2008.04.021zbMath1169.13016OpenAlexW1988690078MaRDI QIDQ1030259
Bruce Reznick, Mari Castle, Victoria Powers
Publication date: 1 July 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.021
Related Items (4)
Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ Descartes' rule of signs is exact! ⋮ Effective Pólya semi-positivity for non-negative polynomials on the simplex ⋮ Pólya's theorem with zeros
Cites Work
- Unnamed Item
- Representing polynomials by positive linear functions on compact convex polyhedra
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- Approximation of the Stability Number of a Graph via Copositive Programming
- A quantitative Pólya's Theorem with corner zeros
- Deciding eventual positivity of polynomials
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- An algorithmic approach to Schmüdgen's Positivstellensatz
This page was built for publication: A quantitative Pólya's theorem with zeros