Univariate rational sums of squares

DOI10.33044/REVUMA.2904MaRDI QIDQ6140075zbMATH OpenFDO

Authors Teresa Krick, Bernard Mourrain, Agnes Szanto

Publication date 19 January 2024

Published in Revista de la Unión Matemática Argentina (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2112.00490

zbMATH Keywords

convex conecertificatesemidefinite matrixsum of squaresexact computationreal rootspositive polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Computational real algebraic geometry (14Q30)

Abstract: Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We complete our study by exhibiting an algorithm that produces a certificate that a polynomial g is non-negative on the real roots of a non-zero polynomial f , when the above assumption is satisfied.

Recommendations

• An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
• Positive polynomials and sums of squares: theory and practice
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
• Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
• Rational certificates of non-negativity on semialgebraic subsets of cylinders

This page was built for publication: Univariate rational sums of squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140075)