Degree bound of P\'olya Positivstellenstaz
Ze Kang Tan

TL;DR
This paper improves bounds on the degree m needed for the positivity of coefficients in Pólya's Positivstellensatz for polynomials of degree 3 and 4, refining previous complexity estimates.
Contribution
The authors provide tighter bounds for the degree m in Pólya's Positivstellensatz specifically for degree 3 and 4 polynomials, improving upon Powers-Reznick's estimates.
Findings
For degree 3, m > 1.5 * (L(P)/λ(P)) - 1
For degree 4, m > (4232/2505) * (L(P)/λ(P)) - 1
Improved bounds reduce the degree m needed for positivity of coefficients.
Abstract
P\'olya's Positivstellensatz on the -simplex says that if is a real polynomial such that whenever , then all the coefficients of are positive whenever is large. Powers-Reznick gave a complexity estimate for P\'olya's Positivstellensatz. Namely, they proved that, for such of degree , all the coefficients of are positive whenever . where is an invariant of . For and specifically, we improve Powers-Reznick's bound by showing for and for .
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
Topicsgraph theory and CDMA systems · Advanced Optimization Algorithms Research · Polynomial and algebraic computation
