2000 character limit reached
On Hilbert's 17th problem in low degree (1602.07330v2)
Published 23 Feb 2016 in math.AG
Abstract: Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2n$ squares are needed. In this paper, we investigate situations where Pfister's theorem may be improved. We show that a real polynomial of degree $d$ in $n$ variables that is positive semidefinite is a sum of $2n-1$ squares of rational functions if $d\leq 2n-2$. If $n$ is even, or equal to $3$ or $5$, this result also holds for $d=2n$.