Pólya's theorem with zeros
From MaRDI portal
Publication:2275902
DOI10.1016/j.jsc.2011.05.006zbMath1218.14051OpenAlexW2070661372MaRDI QIDQ2275902
Mari Castle, Victoria Powers, Bruce Reznick
Publication date: 10 August 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.05.006
Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)
Related Items (5)
A practical approach to SOS relaxations for detecting quantum entanglement ⋮ Aleatoric propositions: reasoning about coins ⋮ Positivstellensätze for quantum multigraphs ⋮ Proving inequalities and solving global optimization problems via simplified CAD projection ⋮ Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
Cites Work
- Unnamed Item
- Pure states, nonnegative polynomials and sums of squares
- Effective Pólya semi-positivity for non-negative polynomials on the simplex
- A quantitative Pólya's theorem with zeros
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- A quantitative Pólya's Theorem with corner zeros
- 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: Pólya's theorem with zeros