Computing multihomogeneous resultants using straight-line programs

Journal of Symbolic Computation

Volumn 42, Issue 1-2, 2007, Pages 218-235

  Jeronimo, Gabriela ^a   Sabia, Juan ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

Multihomogeneous system; Poisson type product formula; Sparse resultant; Symbolic Newton's algorithm

Indexed keywords

EID: 33751434550     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2006.03.006     Document Type: Article

References (37)

1. Bernstein D.N. The number of roots of a system of equations. Funct. Anal. Appl. 9 3 (1975) 183-185
2. Bézout, E., 1979. Théorie Générale des Équations Algébriques, Paris
3. Bürgisser P., Clausen M., and Shokrollahi M.A. Algebraic Complexity Theory (1997), Springer-Verlag
4. Canny J.F., and Emiris I.Z. An efficient algorithm for the sparse mixed resultant. In: Cohen G., Mora T., and Moreno O. (Eds). Proc. Int. Symp. on Appl. Algebra, Algebraic Algorithms and Error-Corr. Codes. Puerto Rico. LNCS vol. 263 (1993) 89-104
5. Canny J.F., and Emiris I.Z. A subdivision-based algorithm for the sparse resultant. J. ACM 47 3 (2000) 417-451
6. Cayley A. On the theory of elimination. Cambridge and Dublin Math. J. 3 (1848) 116-120
7. Cox D., Little J., and O'Shea D. Using Algebraic Geometry. Grad. Texts in Math. vol. 185 (1998), Springer-Verlag
8. D'Andrea C. Macaulay style formulas for sparse resultants. Trans. Amer. Math. Soc. 354 7 (2002) 2595-2629
9. D'Andrea C., and Dickenstein A. Explicit formulas for the multivariate resultant. J. Pure Appl. Algebra 164 1-2 (2001) 59-86
10. Dickenstein A., and Emiris I.Z. Multihomogeneous resultant formulae by means of complexes. J. Symbolic Comput. 36 3-4 (2003) 317-342
11. Emiris I.Z. Toric resultants and applications to geometric modelling. In: Dickenstein A., and Emiris I.Z. (Eds). Solving Polynomial Equations. Foundations, Algorithms, and Applications. Algorithms and Computation in Mathematics vol. 14 (2005), Springer-Verlag, Berlin
12. Emiris I.Z., and Mourrain B. Matrices in elimination theory. J. Symbolic Comput. 28 1-2 (1999) 3-44
13. Gelfand I.M., Kapranov M.M., and Zelevinsky A.V. Discriminants, Resultants, and Multidimensional Determinants (1994), Birkhäuser
14. Giusti M., Heintz J., Hägele K., Morais J.E., Pardo L.M., and Montaña J.L. Lower bounds for Diophantine approximation. J. Pure Appl. Algebra 117&118 (1997) 277-317
15. Giusti M., and Heintz J. La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial. Computational Algebraic Geometry and Commutative Algebra (Cortona, 1991). Sympos. Math. XXXIV (1993), Cambridge Univ. Press, Cambridge 216-256
16. Giusti M., Heintz J., Morais J.E., Morgenstern J., and Pardo L.M. Straight-line programs in geometric elimination theory. J. Pure Appl. Algebra 124 1-3 (1998) 101-146
17. Heintz J. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci. 24 (1983) 239-277
18. Heintz, J., Jeronimo, G., Sabia, J., Solernó, P., 2005. Intersection theory and deformation algorithms: The multihomogeneous case. Manuscript
19. Heintz J., Krick T., Puddu S., Sabia J., and Waissbein A. Deformation techniques for efficient polynomial equation solving. J. Complexity 16 (2000) 70-109
20. Heintz J., and Schnorr C.-P. Testing polynomials which are easy to compute. Monographie 30 de l'Enseignement Mathématique (1982) 237-254
21. Hodge W.V.D., and Pedoe D. Methods of Algebraic Geometry vol. II (1952), Cambridge University Press
22. Jeronimo G., Krick T., Sabia J., and Sombra M. The computational complexity of the Chow form. Found. Comput. Math. 4 1 (2004) 41-117
23. Jouanolou J.P. Le formalisme du résultant. Adv. Math. 90 2 (1991) 117-263
24. Macaulay F. Some formulae in elimination. Proc. London Math. Soc. 1 33 (1902) 3-27
25. McCoy N. On the resultant of a system of forms homogeneous in each of several sets of variables. Trans. Amer. Math. Soc. 35 1 (1933) 215-233
26. McLennan A. The maximum number of real roots of a multihomogeneous system of polynomial equations. Beiträge Algebra Geom. 40 2 (1999) 343-350
27. Minimair M. Sparse resultant under vanishing coefficients. J. Algebraic Combin. 18 1 (2003) 53-73
28. Morgan A., Sommese A., and Wampler C. A product-decomposition bound for Bezout numbers. SIAM J. Numer. Anal. 32 4 (1995) 1308-1325
29. Pedersen P., and Sturmfels B. Product formulas for resultants and Chow forms. Math. Z. 214 (1993) 377-396
30. Shafarevich I. Basic Algebraic Geometry (1972), Springer-Verlag
31. Strassen V. Vermeidung von Divisionen. J. Reine Angew. Math. 264 (1973) 182-202
32. Sturmfels B. Sparse elimination theory. In: Eisenbud D., and Robbbiano L. (Eds). Computational Algebraic Geometry and Commutative Algebra (Cortona, 1991). Sympos. Math. XXXIV (1993), Cambridge Univ. Press 264-298
33. Sturmfels B. On the Newton polytope of the resultant. J. Algebraic Combin. 3 2 (1994) 207-236
34. Sturmfels B., and Zelevinsky A. Multigraded resultants of Sylvester type. J. Algebra 163 (1994) 115-127
35. Sylvester J.J. On a theory of syzygetic relations of two rational integral functions. Comprising an Application to the theory of Sturm's functions, and that of the greatest algebraic common measure. Philos. Trans. 143 (1853) 407-548
36. von zur Gathen J. Parallel arithmetic computations: a survey. Proc. 12th FOCS. LNCS vol. 33 (1986), Bratislava 93-112
37. Weyman J., and Zelevinsky A. Determinantal formulas for multigraded resultants. J. Algebraic Geom. 3 4 (1994) 569-597