On the minimum of a positive polynomial over the standard simplex

• Autores: Gabriela Jerónimo, Daniel Perrucci
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 45, Nº 4, 2010, págs. 434-442
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of , assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize t of the coefficients of P and improves all the previous bounds for arbitrary polynomials which are positive over the simplex.