Skip to main content
Log in

Lower bounds for a polynomial in terms of its coefficients

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

Abstract

We determine new sufficient conditions in terms of the coefficients for a polynomial \({f\in \mathbb{R}[\underline{X}]}\) of degree 2d (d ≥ 1) in n ≥ 1 variables to be a sum of squares of polynomials, thereby strengthening results of Fidalgo and Kovacec (Math. Zeitschrift, to appear) and of Lasserre (Arch. Math. 89 (2007) 390–398). Exploiting these results, we determine, for any polynomial \({f\in \mathbb{R}[\underline{X}]}\) of degree 2d whose highest degree term is an interior point in the cone of sums of squares of forms of degree d, a real number r such that fr is a sum of squares of polynomials. The existence of such a number r was proved earlier by Marshall (Canad. J. Math. 61 (2009) 205–221), but no estimates for r were given. We also determine a lower bound for any polynomial f whose highest degree term is positive definite.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Deutsch E.: Bounds for the zeros of polynomials. Amer. Math. Monthly 88, 205–206 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  • C. Fidalgo and A. Kovacec, Positive semidefinite diagonal minus tail forms are sums of squares, Math. Zeitschrift, to appear.

  • Hilbert D.: Über die Darstellung definiter Formen als Summe von Formenquadraten, Math. Ann. 32, 342–350 (1888)

    MathSciNet  Google Scholar 

  • Knuth: The Art of Computer Programming, Volume 2. Addison-Wesley, New York (1969)

    Google Scholar 

  • Lasserre J.B.: Global Optimization with Polynomials and the Problem of Moments. SIAM J. Optim. 11, 796–817 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Lasserre J.B.: Sufficient Conditions for a Real Polynomial to be a Sum of Squares. Arch. Math. (Basel) 89, 390–398 (2007)

    MATH  MathSciNet  Google Scholar 

  • M. Marshall, Positive Polynomials and Sum of Squares, Mathematical Surveys and Monographs, 146, 2008.

  • Marshall M.: Representation of Non-Negative Polynomials, Degree Bounds and Applications to Optimization. Canad. J. Math., 61, 205–221 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  • Parrilo P.A., Sturmfels B.: Minimizing Polynomial Functions. Ser. Discrete Math. Theor. Comput. Sci. 60, 83–99 (2003)

    MathSciNet  Google Scholar 

  • V. V. Prasolov, Polynomials, Algorithms and Computation in Mathematics 11, 2004.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Murray Marshall.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghasemi, M., Marshall, M. Lower bounds for a polynomial in terms of its coefficients. Arch. Math. 95, 343–353 (2010). https://doi.org/10.1007/s00013-010-0179-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00013-010-0179-0

Mathematics Subject Classification (2000)

Keywords

Navigation