Abstract:
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 Rk, assuming that P is positive on the simplex. This bound depends only on the number of variables k, the degree d and the bitsize τ of the coefficients of P and improves all the previous bounds for arbitrary polynomials which are positive over the simplex. © 2010 Elsevier Ltd. All rights reserved.
Referencias:
- Basu, S., Leroy, R., Roy, M.-F., 2009. A bound on the minimum of a real positive polynomial over the standard simplex, Manuscript. Available at: arXiv:0902.3304; Basu, S., Pollack, R., Roy, M.-F., (2006) Algorithms and Computation in Mathematics, 10. , Springer-Verlag, Berlin
- Bochnak, J., Coste, M., Roy, M.F., (1987) Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 12. , Springer-Verlag, Berlin
- Canny, J., (1987) The Complexity of Robot Motion Planning, , MIT press
- de Loera, J., Santos, F., An effective version of Pólya's theorem on positive definite forms (1996) J. Pure Appl. Algebra, 108 (3), pp. 231-240
- Emiris, I., Mourrain, B., Tsigaridas, E., The DMM bound: Multivariate (aggregate) separation bounds (2009), Manuscript; González-Vega, L., Trujillo, F., Using symmetric functions to describe the solution set of a zero dimensional ideal (1995) Lecture Notes in Comput. Sci., 948, pp. 232-247. , Applied Algebra, Algebraic Algorithms and Error-correcting Codes. Paris, 1995, Springer, Berlin
- Jeronimo, G., Perrucci, D., Sabia, J., On sign conditions over real multivariate polynomials Discrete Comput. Geom, , in press doi:10.1007/s00454-009-9200-4
- Leroy, R., (2008) Certificats de positivité et minimisation polynomiale dans la base de Bernstein multivariée, , Ph.D. Thesis, Université de Rennes 1
- Mignotte, M., Stefanescu, D., (1999) Springer Series in Discrete Mathematics and Theoretical Computer Science, , Springer-Verlag Singapore, Singapore Centre for Discrete Math. & Theoret. Comput. Sci., Auckland
- Powers, V., Reznick, B., A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. Effective methods in algebraic geometry (Bath, 2000) (2001) J. Pure Appl. Algebra, 164 (1-2), pp. 221-229
- Prestel, A., Delzell, C., (2001) Springer Monographs in Mathematics, , Springer-Verlag, Berlin
- Rouillier, F., Solving zero-dimensional systems through the rational univariate representation (1999) Appl. Algebra Eng. Commun. Comput., 9 (5), pp. 433-461
- Schweighofer, M., On the complexity of Schmüdgen's positivstellensatz (2004) J. Complexity, 20 (4), pp. 529-543
- Solernó, P., Effective Łojasiewicz inequalities in semialgebraic geometry (1991) Appl. Algebra Engrg. Comm. Comput., 2 (1), pp. 2-14
Citas:
---------- APA ----------
Jeronimo, G. & Perrucci, D.
(2010)
. On the minimum of a positive polynomial over the standard simplex. Journal of Symbolic Computation, 45(4), 434-442.
http://dx.doi.org/10.1016/j.jsc.2010.01.001---------- CHICAGO ----------
Jeronimo, G., Perrucci, D.
"On the minimum of a positive polynomial over the standard simplex"
. Journal of Symbolic Computation 45, no. 4
(2010) : 434-442.
http://dx.doi.org/10.1016/j.jsc.2010.01.001---------- MLA ----------
Jeronimo, G., Perrucci, D.
"On the minimum of a positive polynomial over the standard simplex"
. Journal of Symbolic Computation, vol. 45, no. 4, 2010, pp. 434-442.
http://dx.doi.org/10.1016/j.jsc.2010.01.001---------- VANCOUVER ----------
Jeronimo, G., Perrucci, D. On the minimum of a positive polynomial over the standard simplex. J. Symb. Comput. 2010;45(4):434-442.
http://dx.doi.org/10.1016/j.jsc.2010.01.001