Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares

DOI10.1145/3597066.3597072arXiv2302.02202OpenAlexW4319784895WikidataQ131125487 ScholiaQ131125487MaRDI QIDQ6081964

Victor Magron, Tristan Vaccon, Przemysław Koprowski

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

real algebraic geometryrational polynomialnorm equationsums of squares decompositionnonnegative univariate rational polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient and accurate computation of upper bounds of approximation errors
• Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
• Short proofs using compact representations of algebraic integers
• On exact Reznick, Hilbert-Artin and Putinar's representations
• Computing sum of squares decompositions with rational coefficients
• SONC optimization and exact nonnegativity certificates via second-order cone programming
• Global Optimization with Polynomials and the Problem of Moments
• Subexponential class group and unit group computation in large degree number fields
• Reducing number field defining polynomials: an application to class group computations
• Certified Roundoff Error Bounds Using Semidefinite Programming
• Fast Reflexive Arithmetic Tactics the Linear Case and Beyond
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Randomized algorithms in number theory
• An algorithm for finding an algebraic number whose norm is a given rational number.
• Editor's Corner: The Euclidean Algorithm Strikes Again
• Solving norm equations in relative number fields using $S$-units
• Dirichlet’s proof of the three-square theorem: An algorithmic perspective
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• R <scp>eal</scp> c <scp>ertify</scp>
• Advanced Topics in Computional Number Theory
• Exact Optimization via Sums of Nonnegative Circuits and Arithmetic-geometric-mean-exponentials
• Formal Proofs for Nonlinear Optimization
• A FORMAL PROOF OF THE KEPLER CONJECTURE
• Sur la représentation en somme de carrés des polynômes à une indéterminée sur un corps de nombres algébriques
• On solving relative norm equations in algebraic number fields

This page was built for publication: Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares