Estimates of the Pythagoras number of Rm [x1, ..., xn] through lattice points and polytopes

David B. Leep, Colin L. Starr

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Hilbert's 17th Problem launched a number of inquiries into sum-of-squares representations of polynomials over the real numbers. Choi, Lam, and Reznick gave some bounds on the number of squares required for such a representation and indicated some directions for improving these bounds. In the first part of this paper, we follow their suggestion and obtain some stronger bounds. In the second part, we show that in the case of homogeneous polynomials in three variables, this technique cannot be extended further.

Original languageEnglish
Pages (from-to)5771-5781
Number of pages11
JournalDiscrete Mathematics
Volume308
Issue number23
DOIs
StatePublished - Dec 6 2008

Keywords

  • Cage
  • Lattice points
  • Polytopes
  • Pythagoras number
  • Sum of squares

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Estimates of the Pythagoras number of Rm [x1, ..., xn] through lattice points and polytopes'. Together they form a unique fingerprint.

Cite this