# Sums of squares of polynomials with rational coefficients

@article{Scheiderer2012SumsOS, title={Sums of squares of polynomials with rational coefficients}, author={Claus Scheiderer}, journal={arXiv: Algebraic Geometry}, year={2012} }

We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally raised by Sturmfels. We also study representations of f as sums of squares of rational functions with rational coefficients. In the case of ternary quartics, we prove that our counterexamples to Sturmfels' question are the only ones.

#### 26 Citations

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients

- Computer Science, Mathematics
- ArXiv
- 2021

It is proved that, actually, certificates of non-negativity modulo gradient ideals can be obtained exactly, over the rationals if the polynomial under consideration has rational coefficients and the authors provide exact algorithms to compute them. Expand

Two remarks on sums of squares with rational coefficients

- Mathematics
- 2019

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is… Expand

On the bad points of positive semidefinite polynomials

- Mathematics
- 2021

A bad point of a positive semidefinite real polynomial f is a point at which a pole appears in all expressions of f as a sum of squares of rational functions. We show that quartic polynomials in… Expand

Rational sums of hermitian squares of free noncommutative polynomials

- Mathematics, Computer Science
- Ars Math. Contemp.
- 2015

It is shown that the numerical evidence, obtained by the Gram matrix method and semidefinite programming, can be frequently tweaked to obtain an exact certificate using rational numbers. Expand

Algebraic Certificates of (Semi)Definiteness for Polynomials Over Fields Containing the Rationals

- Mathematics, Computer Science
- IEEE Transactions on Automatic Control
- 2018

A new algorithm, which works well in “almost all” SOS decomposition cases, is proposed here and the results of randomly generated experiments are reported to compare the proposed algorithm with those based on convex optimization. Expand

Gram Spectrahedra.

- Mathematics
- 2018

Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are… Expand

Facial reduction for exact polynomial sum of squares decomposition

- Mathematics, Computer Science
- Math. Comput.
- 2020

It is proved that if f is the sum of two squares with coefficients in an algebraic extension of ${\mathbb Q}$ of odd degree, then it can always be decomposed as a rational SOS. Expand

SPECTRA – a Maple library for solving linear matrix inequalities in exact arithmetic

- Computer Science, Mathematics
- Optim. Methods Softw.
- 2019

This document describes the freely distributed Maple library spectra, for Semidefinite Programming solved Exactly with Computational Tools of Real Algebra, targeted to small-size problems for which symbolic infeasibility or feasibility certificates are required. Expand

A proof of Hilbert's theorem on ternary quartic forms with the ladder technique

- Mathematics, Computer Science
- ArXiv
- 2017

This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is… Expand

Exact algorithms for semidefinite programs with degenerate feasible set

- Computer Science, Mathematics
- J. Symb. Comput.
- 2021

This paper designs an exact algorithm based on symbolic homotopy for solving semidefinite programs without assumptions on the feasible set, and it is proved that solving such problems can be done in polynomial time if either n or m is fixed. Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

SUMS OF SQUARES OVER TOTALLY REAL FIELDS ARE RATIONAL SUMS OF SQUARES

- Mathematics
- 2007

Let K be a totally real number field with Galois closure L. We prove that if f ∈ Q(x 1 ,.., x n ] is a sum of m squares in K[x 1 ,.., x n ], then f is a sum of 4m·2 [L:Q]+1 ( [L:Q+1 2 ) squares in… Expand

Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients

- Mathematics, Computer Science
- J. Symb. Comput.
- 2012

We present a hybrid symbolic-numeric algorithm for certifying a polynomial or rational function with rational coefficients to be non-negative for all real values of the variables by computing a… Expand

Tight bounds for rational sums of squares over totally real fields

- Mathematics
- 2010

AbstractLet K be a totally real Galois number field. Hillar proved that if f ∈ ℚ[x1, ..., xn] is a sum of m squares in K[x1, ..., xn], then f is a sum of N(m) squares in ℚ[x1, ..., xn], where N(m) ≤… Expand

Quadratic and Hermitian Forms

- Mathematics
- 1984

This chapter presents quadratic and hermitian forms. The chapter also presents a theorem which states that the inverse of a nonsingular linear transformation is a nonsingular linear transformation.… Expand

Moments, Positive Polynomials And Their Applications

- Mathematics
- 2009

. From a theoretical viewpoint, the GPM has developments and impact in var-ious area of Mathematics like algebra, Fourier analysis, functional analysis, operator theory, probabilityand statistics, to… Expand

Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions

- Computer Science, Mathematics
- SIAM J. Optim.
- 2010

An algorithm returning a rational point in $\mathcal{S}$ if and only if $S}\cap\mathbb{Q}\neq\emptyset$ requires bit operations and the coefficients of the outputted polynomials have bit length dominated by $\tau D^{O}(k^3)}$. Expand

Convex Optimization

- Mathematics, Computer Science
- IEEE Transactions on Automatic Control
- 2006

A comprehensive introduction to the subject of convex optimization shows in detail how such problems can be solved numerically with great efficiency. Expand

Handbook on semidefinite, conic and polynomial optimization

- Mathematics
- 2012

Introduction to Semidefinite, Conic and Polynomial Optimization.- The Approach of Moments for Polynomial Equations.- Algebraic Degree in Semidefinite and Polynomial Optimization.- Semidefinite… Expand

Handbook of semidefinite programming : theory, algorithms, and applications

- Mathematics
- 2000

Contributing Authors. List of Figures. List of Tables. Preface. 1. Introduction H. Wolkowicz, et al. Part I: Theory. 2. Convex Analysis on Symmetric Matrices F. Jarre. 3. The Geometry of Semidefinite… Expand

Advances in convex optimization: conic programming

- Mathematics
- 2006

During the last two decades, major developments in convex optimization were focusing
on conic programming, primarily, on linear, conic quadratic and semidefinite optimization.
Conic programming… Expand