Toric intersection theory for affine root counting

Journal of Pure and Applied Algebra

Volumn 136, Issue 1, 1999, Pages 67-100

  Rojas, J M ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033522024     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(98)00023-1     Document Type: Article

References (59)

1. D.N. Bernshtein, The number of roots of a system of equations, Funct. Anal. Appl. (translated from Russian) 9 (2) (1975) 183-185.
2. Yu.D. Burago, V.A. Zalgailer, Geometric Inequalities, Grundlehren der Mathematischen Wissenschaften vol. 285, Springer, Berlin, 1988.
3. J.F. Canny, I.Z. Emiris, An efficient algorithm for the sparse mixed resultant, Proc. AAECC, Puerto Rico, May, Lecture Notes in Computer Science, vol. 263. Springer, Berlin, 1993, pp. 89-104.
4. D. Cox, J. Little, D. O'Shea, Ideals, Varieties, and Algorithms, Undergraduate Texts in Mathematics, Springer, Berlin, 1992.
5. V.I. Danilov, The geometry of Toric varieties, Russian Math. Surveys 33 (2) (1978) 97-154.
6. V.I. Danilov, A. Khovanskii, Newton polyhedra and an algorithm for computing Hodge-Deligne numbers, Math. USSR Ivzestiya 29 (2) (1987) 279-298.
7. M. Dyer, P. Gritzmann, A. Hufnagel, On the complexity of computing mixed volumes, SIAM J. Comput. 27 (1998) 356-400.
8. I.Z. Emiris, J.F. Canny, Efficient incremental algorithms for the sparse resultant and the mixed volume, J. Symbolic Comput. 20 (1995) 117-149.
9. D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Mathematics, Graduate Texts in Mathematics, vol. 150, Springer, Berlin, 1995.
10. I.Z. Emiris, Sparse Elimination and Applications in Kinematics, Ph.D. Dissertation, Computer Science Division, U.C. Berkeley, December, 1994, available on-line at http://www.inria.fr/saga emiris.
11. W. Fulton, Introduction to intersection theory in algebraic geometry, Regional Conference Series in Mathematics, no. 54, Amer. Math. Soc., Providence, RI, 1984.
12. W. Fulton, Intersection Theory, Springer, Berlin, 1984.
13. W. Fulton, Introduction to toric varieties, Annals of Mathematics Studies, No. 131, Princeton University Press, Princeton, NJ, 1993.
14. I.M. Gel'fand, M.M. Kapranov, A.V. Zelevinsky, Discriminants of polynomials in several variables and triangulations of Newton polytopes, Algebra and Analysis (translated from Russian) 2 (1990) 1-62.
15. I.M. Gel'fand, M.M. Kapranov, A.V. Zelevinsky, Discriminants, Resultants and Multidimensional Determinants, Birkhauser, Boston, 1994.
16. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd Ed. Addison-Wesley, Reading, MA, 1994.
17. J.L. Hafner, K.S. McCurley, Asymptotically fast triangularization of matrices over rings, SIAM J. Comput. 20 (6) (1991) 1068-1083.
18. R. Hartshorne, Algebraic Geometry, Springer, Berlin, 1977.
19. B. Huber, B. Sturmfels, A polyhedral method for solving sparse polynomial systems, Math. Comput. 64 (1995) 1541-1555.
20. B. Huber, B. Sturmfels, Bernshtein's theorem in affine space, Discrete Comput. Geom. 17 (1998) 137-141.
21. C.S. Iliopoulos, Worst case complexity bounds on algorithms for computing the canonical structure of finiter Abelian groups and the Hermite and Smith normal forms of an integer matrix, SIAM J. Comput. 18 (4) (1989) 658-669.
22. N. Jacobson, Basic Algebra 1, 2nd Ed., Freeman, San Francisco, CA, 1985.
23. M.M. Kapranov, B. Sturmfels, A.V. Zelevinsky, Chow polytope and general resultants, Duke Math. J. 67 (1) (1992) 189-218.
24. G. Kempf, F. Knudsen, D. Mumford, B. Saint-Donat, Toroidal embeddings I, Lecture Notes in Mathematics, vol. 339, Springer, Berlin, 1973.
25. A.G. Khovanskii, Newton polyhedra and toroical varieties, Funct. Anal. Appl. 11 (1977) 289-296.
26. A.G. Khovanskii, Newton polyhedra and the genus of complete intersections, Funct. Anal. (translated from Russian) 12 (1) (1978) 51-61.
27. A.G. Kushnirenko, A Newton polytope and the number of solutions of a system of k equations in k unknowns, Usp. Matem. Nauk. 30 (2) (1975) 266-267.
28. A.G. Kushnirenko, Newton polytopes and the Bézout theorem, Funct. Anal. Appl. (translated from Russian) 10 (3) (1976) 82-83.
29. n, Math. Comput. 65 (1996) 1477-1484.
30. A.P. Morgan, A.J. Sommese, C.W. Wampler, A product-decomposition theorem for bounding Bézout numbers, SIAM J. Numer. Anal. 32 (4) (1995) 1308-1325.
31. D. Mumford, Algebraic Geometry I: Complex Algebraic Varieties, Springer, Berlin, 1976.
32. T. Oda, Convex Bodies and Algebraic Geometry: An Introduction to the Theory of Toric Varieties, Springer, Berlin, 1988.
33. D. Parsons, J.F. Canny, Geometric problems in molecular biology and robotics, Proc. 2nd Int. Conf. on Intelligent Systems for Molecular Biology, Palo Alto, CA, August, 1994.
34. P. Pedersen, B. Sturmfels, Product formulas for sparse resultants and Chow forms, Math. Z. 214 (1993) 377-396.
35. J.M. Rojas, When can one easily find the number of roots of a nonhomogeneous polynomial system? extended abstract presented at the 40th Annual Meeting of the Society for Industrial and Applied Mathematics, Los Angeles, July 15-19, 1992.
36. J.M. Rojas, A convex geometric approach to counting the roots of a polynomial system, Theoret. Comput. Sci. 133 (1) (1994) 105-140. (Additional notes and corrections available on-line at http://www.cityu.edu.hk/ma/staff/rojas.
37. J.M. Rojas, On the average number of real roots of certain random sparse polynomial systems, in: J. Renegar, M. Shub, S. Smale (Eds.), Amer. Math. Soc., Providence, RI, 1996, pp. 689-699.
38. J.M. Rojas, Toric laminations, sparse generalized characteristic polynomials, and a refinement of Hilbert's tenth problem, Foundations of Computational Mathematics, selected papers of a conference, held at IMPA in Rio de Janeiro, January 1997, Springer, Berlin, 1997.
39. J.M. Rojas, The Geometry of Elimination I: Degree Formulae and the Vanishing of Resultants, preprint.
40. J.M. Rojas, Affine elimination theory (extended abstract), Proc. Conf. in Honor of the 60th Birthday of David A. Buchsbaum, Northeastern University, October 1997
41. J.M. Rojas, X. Wang, Counting affine roots of polynomial systems via pointed Newton polytopes, J. Complexity 12 (1996) 116-133.
42. R. Schneider, Convex bodies: The Brunn-Minkowski theory, Encyclopedia of Mathematics and its Applications, vol. 44, Cambridge University Press, Cambridge, 1994.
43. I.N. Shafarevich, Basic Algebraic Geometry, Springer Study Editions, Springer, Berlin, 1980.
44. M. Shub, Some remarks on Bézout's theorem and complexity theory, in: From Topology to Computation: Proc. Smalefest, Springer, Berlin, 1993, pp. 443-455.
45. J. Silverman, The Arithmetic of Elliptic Curves, Springer Graduate Texts in Mathematics, vol. 106, Springer, Berlin, 1986.
46. B. Sturmfels, More examples of A-resultants, letter to Misha Kapranov, 1992.
47. B. Sturmfels, Sparse elimination theory, in D. Eisenbud, L. Robbiano (Eds.), Proc. Computat. Algebraic Geom. and Commut. Algebra 1991, Cortona, Italy, Cambridge Univ. Press, Cambridge, 1993, pp. 377-396.
48. B. Sturmfels, On the Newton polytope of the resultant, J. Algebraic Combinatorics 3 (1994) 207-236.
49. B. Sturmfels, Gröbner bases and convex polytopes, Lectures presented at the Holiday Symposium at New Mexico State University, 27-31 December 1994.
50. B. Sturmfels, A. Zelevinsky, Multigradd resultants of Sylvester type, J. Algebra 163 (1) (1994) 115-127.
51. J. Verscheide, Homotopy Continuation Methods for Solving Polynomial Systems, Doctoral Dissertation, Katholieke Universiteit Leuven, Leuven, Belgium, May 1996.
52. J. Verschelde, K. Gatermann, R. Cools, Mixed volume computation by dynamic lifting applied to polynomial system solving, Discrete Comput. Geom. 16 (1) (1996) 69-112.
53. C.W. Wampler, Bezout number calculations for multi-homogeneous polynomial systems, Appl. Math. Comput. 51 (1992) 143-157.
54. Warren, A bound on the implicit degree of polygonal Bézier surfaces, in: C.L. Bajaj (Ed.), Algebraic Geometry and its Applications, pp. 513-525.
55. I.Z. Emiris, J. Verschelde, How to count efficiently all affine roots of a polynomial system, INRIA Rapport de Recherche No. 3212, 1997.
56. n via stable mixed subdivisions, J. Symbolic Comput., to appear.
57. B. Huber, J. Verschelde, Polyhedral end games for polynomial continuation, Report TW254, Dept. of Computer Science, K.U. Leuven, 1997.
58. J.M. Rojas, Intrinsic near quadratic complexity bounds for real multivariate root counting, Proc. 6th Annual European Symp. on Algorithms, Lecture Notes in Computer Science, vol. 1461, Springer, Berlin, 1998.
59. J.M. Rojas, solving degenerate sparse polynomial systems faster, J. Symbolic Comput., special issue on Elimination Theory, to appear.