Artículo

Estamos trabajando para incorporar este artículo al repositorio
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

We present formulas for computing the resultant of sparse polynomials as a quotient of two determinants, the denominator being a minor of the numerator. These formulas extend the original formulation given by Macaulay for homogeneous polynomials.

Registro:

Documento: Artículo
Título:Macaulay style formulas for sparse resultants
Autor:D'Andrea, C.
Filiación:Departamento de Matemática, Ciudad Universitaria (1428), Universidad de Buenos aires, Buenos Aires, Argentina
Año:2002
Volumen:354
Número:7
Página de inicio:2595
Página de fin:2629
DOI: http://dx.doi.org/10.1090/S0002-9947-02-02910-0
Título revista:Transactions of the American Mathematical Society
Título revista abreviado:Trans. Am. Math. Soc.
ISSN:00029947
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00029947_v354_n7_p2595_DAndrea

Referencias:

  • Auzinger, W., Stetter, H.J., An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations (1988) Proc. Intern. Conf. on Numerical Math., Intern. Series of Numerical Math., 86, pp. 11-30. , [AS] Birkhäuser Verlag, Basel, MR 91g:65112
  • Bézout, E., (1779) Théorie Générale des Équations Algébriques, , [Bez] Paris
  • Bernstein, D.N., The number of roots of a system of equations (1975) Functional Anal. Appl., 9, pp. 183-185. , [Ber] MR 55:8034
  • Canny, J.F., (1988) The Complexity of Robot Motion Planning, , [Can1] M.I.T. Press, Cambridge, Mass. MR 89m:68142
  • Canny, J.F., Generalised characteristic polynomials (1990) J. Symbolic Computation, 9, pp. 241-250. , [Can2] MR 91i:13030
  • Canny, J.F., Emiris, I.Z., An efficient algorithm for the sparse mixed resultant (1993) Proc. Int. Symp. on Appl. Algebra, Algebraic Algorithms and Error-Corr. Codes, pp. 89-104. , [CE1] Cohen, G., Mora, T. and Moreno, O., eds, Puerto Rico, LNCS 263, Berlin, Springer Verlag. MR 94m:12010
  • Canny, J.F., Emiris, I.Z., A subdivision-based algorithm for the sparse resultant (2000) J. ACM, 47 (3), pp. 417-451. , [CE2] May CMP 2000:15
  • Cattani, E., Dickenstein, A., Sturmfels, B., Residues and resultants (1998) J. Math. Sci. Univ. Tokyo, 5, pp. 119-148. , [CDS] MR 2000b:14065
  • Cayley, A., On the theory of elimination (1848) Cambridge and Dublin Math. J., 3, pp. 116-120. , Cay
  • Chardin, M., The resultant via a Koszul complex (1993) Computational Algebraic Geometry, volume 109 of Progress in Mathematics, pp. 29-39. , [Cha] Eyssette and A. Galligo, editors, Birkhäuser, Boston MR 94f:12002
  • Cox, D., The homogeneous coordinate ring of a toric variety (1995) J. Algebr. Geom., 4, pp. 17-50. , [Cox] MR 95i:14046
  • Cox, D., Little, J., O'Shea, D., Using algebraic geometry (1998) Number 185 in Graduate Texts in Mathematics, , [CLO] Springer-Verlag, New York MR 99h:13033
  • D'Andrea, C., Dickenstein, A., Explicit formulas for the multivariate resultant (2001) Journal of Pure and Applied Algebra, 164 (1-2), pp. 59-86. , DD
  • Demazure, M., Une définition constructive du résultant (1984) Notes Informelles de Calcul Formel, 2. , [Dem] prepublication du Centre de Mathématiques de l' École Polytechnique
  • Dixon, A.L., The eliminant of three quantics in two independent variables (1908) Proc. London Math. Soc., 6, pp. 49-69. , Dix
  • Emiris, I.Z., (1994) Sparse Elimination and Applications in Kinematics, , [Emi1] Ph.D. Thesis, University of California at Berkeley
  • Emiris, I.Z., A complete implementation for computing general dimensional convex hulls (1998) Intern. J. Computational Geometry & Applications, Special Issue on Geometric Software, 223-253 (2). , [Emi2] CMP 98:10
  • Emiris, I.Z., Mourrain, B., Matrices in elimination theory (1999) J. Symbolic Computation, 28 (1-2), pp. 3-44. , [EM] MR 2000h:68249
  • Fulton, W., Introduction to toric varieties (1993) Ann. of Math. Studies, 131. , [Ful] Princeton, NJ, Princeton University Press MR 94g:14028
  • Gelfand, I.M., Kapranov, M.M., Zelevinski, A.V., Discriminants of polynomials in several variables and triangulations of Newton polytopes (1991) Leningrad Math. J., 2 (3), pp. 449-505. , [GKZ1] MR 91m:14080
  • Gelfand, I.M., Kapranov, M.M., Zelevinski, A.V., (1994) Discriminants, Resultants and Multidimensional Determinants, , [GKZ2] Birkhäuser, Boston-Basel-Berlin MR 95e:14045
  • Huber, B., Sturmfels, B., A polyhedral method for solving sparse polynomial systems Math. Comput., 64, pp. 1542-1555. , [HS] MR 95m:65100
  • Jouanolou, J.P., Formes d'inertie et résultant: Un formulaire (1997) Advances in Mathematics, 126, pp. 119-250. , [Jou] Mr 98k:14002
  • Kapranov, M., Sturmfels, B., Zelevinsky, A., Chow polytopes and general resultants (1992) Duke Mathematical Journal, 67 (1), pp. 189-217. , [Ksz] Mr 93e:14062
  • Krick, T., Pardo, L.M., Sombra, M., Sharp estimates for the arithmetic null stellensatz (2001) Duke Mathematical Journal, 109 (3), pp. 521-598. , Kps
  • Lazard, D., Résolution des systèmes d' équations algebriques (1981) Theor. Comp. Science, 15, pp. 77-110. , [Laz] Mr 82i:12001
  • Macaulay, F., Some formulae in elimination Proc. London Math. Soc., 1 (33), pp. 3-27. , Mac
  • Minimair, M., (2001) Sparse Resultant under Vanishing Coefficients, , http://minimair.org, [Min] Preprint
  • Pedersen, P., Sturmfels, B., Product formulas for resultants and chow forms (1993) Mathematische Zeitschrift, 214, pp. 377-396. , [Ps] Mr 94m:14068
  • Renegar, J., On the computational complexity and geometry of the first-order theory of the reals, parts I, II, III (1992) J. Symbolic Computacion, 13 (3), pp. 255-352. , [Ren] Mp 93h:03011
  • Rojas, J.M., Solving degenerate sparse polynomial systems faster (1999) J. Symbolic Computation, 28, pp. 155-186. , [Roj] Mr 2000g:65050
  • Sturmfels, B., Sparse elimination theory (1991) Computation Algebraic Geometry and Commutative Algebra, pp. 264-298. , [Stu1] D. Eisenbud and L. Robbiano, editors, Proceedings, Cortona, June. Cambridge University Press, Mr 94k:13035
  • Sturmfels, B., On the newton polytope of the resultant (1994) Journal of Algebraic Combinatorics, 3, pp. 207-236. , [Stu2] Mr 95j:52024
  • Sturmfels, B., Introduction to resultants (1998) Proc. Sympos. Appl. Math, 53, pp. 25-39. , [Stu3] Applications of Computational Algebraic Geometry, San Diego, January 1997, Amer. Math. Soc., Providence, Ri, Mr 99a:13015
  • Sturmfels, B., Zelevinsky, A., Multigraded resultants of sylvester type (1994) J. of Algebra, 163 (1), pp. 115-127. , [Sz] Mr 95i:14050
  • 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 (1853) Philosophical Trans., 143, pp. 407-548. , Syl
  • Weyman, J., Zelevinsky, A., Determinantal formulas for multigraded resultants (1994) J. Algebraic Geometry, 3, pp. 569-597. , [Wz] Mr 95j:14074
  • Zhang, M., Chionh, E.W., Goldman, R.N., Rectangular corner cutting Sylvester A-resultant (2000) Proc. Acm Intern. Symp. on Symbolic and Algebraic Computation, , Zcg

Citas:

---------- APA ----------
(2002) . Macaulay style formulas for sparse resultants. Transactions of the American Mathematical Society, 354(7), 2595-2629.
http://dx.doi.org/10.1090/S0002-9947-02-02910-0
---------- CHICAGO ----------
D'Andrea, C. "Macaulay style formulas for sparse resultants" . Transactions of the American Mathematical Society 354, no. 7 (2002) : 2595-2629.
http://dx.doi.org/10.1090/S0002-9947-02-02910-0
---------- MLA ----------
D'Andrea, C. "Macaulay style formulas for sparse resultants" . Transactions of the American Mathematical Society, vol. 354, no. 7, 2002, pp. 2595-2629.
http://dx.doi.org/10.1090/S0002-9947-02-02910-0
---------- VANCOUVER ----------
D'Andrea, C. Macaulay style formulas for sparse resultants. Trans. Am. Math. Soc. 2002;354(7):2595-2629.
http://dx.doi.org/10.1090/S0002-9947-02-02910-0