A quantitative Pólya's Theorem with zeros

Mari Castle, Victoria Powers, Bruce Reznick

Research output: Contribution to journalArticle

Abstract

Let R [X] : = R [X1, ..., Xn]. Pólya's Theorem says that if a form (homogeneous polynomial) p ∈ R [X] is positive on the standard n-simplex Δn, then for sufficiently large N all the coefficients of (X1 + ⋯ + Xn)N p are positive. The work in this paper is part of an ongoing project aiming to explain when Pólya's Theorem holds for forms if the condition "positive on Δn" is relaxed to "nonnegative on Δn", and to give bounds on N. Schweighofer gave a condition which implies the conclusion of Pólya's Theorem for polynomials f ∈ R [X]. We give a quantitative version of this result and use it to settle the case where a form p ∈ R [X] is positive on Δn, apart from possibly having zeros at the corners of the simplex.

Original languageEnglish (US)
Pages (from-to)1285-1290
Number of pages6
JournalJournal of Symbolic Computation
Volume44
Issue number9
DOIs
StatePublished - Sep 1 2009

Keywords

  • Positive polynomials
  • Pólya's Theorem
  • Sums of squares

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics

Fingerprint Dive into the research topics of 'A quantitative Pólya's Theorem with zeros'. Together they form a unique fingerprint.

  • Cite this