We study certificates of positivity for univariate polynomials with rational coefficients that are positive over (an interval of) $\mathbb{R}$, given as weighted sums of squares (SOS) of rational polynomials. We build on the algorithm of Chevillard, Harrison, Joldes, and Lauter~\cite{chml-usos-alg-11}, which we call \usos. For a polynomial of degree~$d$ and coefficient bitsize~$\tau$, we show that a rational weighted SOS representation can be computed in $\widetilde{\mathcal{O}}_B(d^3 + d^2 \tau)$ bit operations, and the certificate has bitsize $\widetilde{\mathcal{O}}(d^2 \tau)$. This improves the best-known bounds by a factor~$d$ and completes previous analyses. We also extend the method to positivity over arbitrary rational intervals, again saving a factor~$d$. For univariate rational polynomials we further introduce \emph{perturbed SOS certificates}. These consist of a sum of two rational squares approximating the input polynomial so that nonnegativity of the approximation implies that of the original. Their computation has the same bit complexity and certificate size as in the weighted SOS case. We also investigate structural properties of these SOS decompositions. Using the classical fact that any nonnegative univariate real polynomial is a sum of two real squares, we prove that the summands form an interlacing pair. Their real roots correspond to the Karlin points of the original polynomial, linking our construction to the T-systems of Karlin~\cite{Karlin-repr-pos-63}. This enables explicit computation of such decompositions, whereas only existential results were previously known. We obtain analogous results for positivity over $(0,\infty)$ and thus over arbitrary real intervals. Finally, we present an open-source Maple implementation of \usos and report experiments on diverse inputs that demonstrate its efficiency.

翻译：暂无翻译