A sparse effective Nullstellensatz

Advances in Applied Mathematics

Volumn 22, Issue 2, 1999, Pages 271-295

  Sombra, Martín ^a  

^a UNIVERSIDAD NACIONAL DE LA PLATA   (Argentina)

Author keywords

Cohen Macaulay ring; Degree of a polynomial system of equations; Effective Nullstellensatz; Newton polytope

Indexed keywords

EID: 0033076908     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1998.0633     Document Type: Article

References (39)

1. Almeida M. S. Función de Hilbert de álgebras graduadas y Nullstellensatz afín efectivo. Tesis de Licenciatura. 1995;Univ. Buenos Aires.
2. Amoroso F. On a conjecture of C. Berenstein and A. Yger. Algorithms in Algebraic Geometry and Applications, Proceedings MEGA'94. Birkhäuser Progress in Math. 143:1996;Birkhäuser, Basel. p. 17-28.
3. Berenstein C. A., Struppa D. C. Recent improvements in the complexity of the effective Nullstellensatz. Linear Alg. Appl. 157:1991;203-215.
4. n]. Acta Math. 166:1991;69-120.
5. Bernshtein D. N. The number of roots of a system of equations. Functional Anal. Appl. 9:1975;183-185.
6. Brownawell W. D. Bounds for the degrees in the Nullstellensatz. Ann. Math. 126:1987;577-591.
7. Brownawell W. D., Masser D. W. Multiplicity estimates for analytic functions II. Duke J. Math. 47:1980;273-295.
8. Caniglia L., Galligo A., Heintz J. Some new effectivity bounds in computational geometry. Mora T. Proceedings AAECC-6. Lecture Notes in Computer Science. 357:1989;131-151 Springer, Berlin.
9. J. Canny, I. Emiris, A subdivision-based algorithm for the sparse resultant, preprint, 1996.
10. Danilov V. I. The geometry of toric varieties. Russian Math. Surveys. 33:1978;97-154.
11. Dubé T. W. A combinatorial proof of the effective Nullstellensatz. J. Symb. Comp. 15:1993;277-296.
12. Ewald G., Wessels U. On the ampleness of invertible sheaves in complete toric varieties. Results Math. 25:1991;275-278.
13. Fitchas N., Galligo A. Nullstellensatz effectif et conjecture de Sèrre (théorème de Quillen-Suslin) pour le Calcul Formel. Math. Nachr. 149:1990;231-253.
14. Fulton W. Introduction to Toric Varieties. Ann. Math. Studies. 131:1993;Princeton Univ. Press, Princeton.
15. Giusti M., Hägele K., Heintz J., Montaña J. L., Morais J. E., Pardo L. M. Lower bounds for diophantine approximation. J. Pure Appl. Algebra. 117 & 118:1997;277-317.
16. Giusti M., Heintz J., Morais J. E., Morgenstern J., Pardo L. M. Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra. 124:1998;101-146.
17. K. Hägele, J. E. Morais, L. M. Pardo, M. Sombra, On the intrinsic complexity of the arithmetic Nullstellensatz, J. Pure Appl. Algebra.
18. Harris J. Algebraic Geometry: A First Course. Graduate Texts in Math. 133:1992;Springer, Berlin.
19. Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24:1983;239-277.
20. Huber B., Sturmfels B. A polyhedral method for solving sparse polynomial systems. Math. Comp. 64:1995;1541-1555.
21. Kollár J. Sharp effective Nullstellensatz. J. Amer. Math. Soc. 1:1988;963-975.
22. Krick T., Pardo L. M. A computational method for diophantine approximation. González-Vega L., Recio T. Algorithms in Algebraic Geometry and Applications, Proceedings MEGA'94. Birkhäuser Progress in Math. 143:1996;193-253 Birkhäuser, Basel.
23. Krick T., Sabia J., Solernó P. On intrinsic bounds in the Nullstellensatz. AAECC J. 8:1997;125-134.
24. Kushnirenko A. G. Newton polytopes and the Bézout theorem. Functional Anal. Appl. 10:1976;82-83.
25. Matsumura H. Commutative Ring Theory. 1986;Cambridge Univ. Press, Cambridge.
26. Pardo L. M. How upper and lower bounds meet in elimination theory. Cohen G., Giusti M., Mora T. Proceedings AAECC-11. Lecture Notes in Computer Science. 948:1995;33-69 Springer, Berlin.
27. Philippon P. Dénominateurs dans le théorème des zeros de Hilbert. Acta Arith. 58:1990;1-25.
28. J. M. Rojas, Toric generalized characteristic polynomials, preprint, 1997.
29. Rojas J. M. Toric laminations, sparse generalized characteristic polynomials, and a refinement of Hilbert's tenth problem. Cucker F., Shub M. Foundations of Computational Mathematics. 1997;369-381 Springer, Berlin.
30. Sabia J., Solernó P. Bounds for traces in complete intersections and degrees in the Nullstellensatz. AAECC J. 6:1995;353-376.
31. Shiffman B. Degree bounds for the division problem in polynomial ideals. Michigan Math. J. 36:1989;163-171.
32. F. Smietanski, Quelques bornes effectives pour le théorème des zéros avec paramètres, Univ. Nice-Sophia Antipolis, 1994.
33. Sombra M. Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz. J. Pure Appl. Algebra. 117 & 118:1997;565-599.
34. Sturmfels B. Sparse elimination theory. Eisenbud D., Robbiano L. Proceedings of the Cortona conference on computational algebraic geometry and commutative algebra. Symposia Matematica XXXIV, Ist. Naz. di Alta Matematica. 1993;377-396 Cambridge Univ. Press, Cambridge.
35. Sturmfels B. Gröbner bases and convex polytopes. Amer. Math. Soc. 8:1996.
36. Teissier B. Résultats récents d'algèbre commutative effective. 1991;Soc. Math. France. p. 107-131.
37. Verschelde J., Verlinden P., Cools R. Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31:1994;915-930.
38. Vogel W. Lectures on results on Bézout theorem. Tata Lecture Notes. 74:1984;Springer, Berlin.
39. Zariski O., Samuel P. Commutative Algebra. 1958, 1960;Van Nostrand, New York.