Subresultants and the Shape Lemma

Cox, David; D’Andrea, Carlos

doi:10.1090/mcom/3840

Subresultants and the Shape Lemma
HTML articles powered by AMS MathViewer

by David A. Cox and Carlos D’Andrea HTML | PDF

Math. Comp. 92 (2023), 2355-2379 Request permission

Abstract:

In nice cases, a zero-dimensional complete intersection ideal over a field has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators. This paper explores the relation between these representations and studies when the resultant generates the elimination ideal. We also prove a Poisson formula for resultants arising from the hidden variable method.

References

N. H. Abel, Mémoire sur une propriété générale d’une classe très-étendue de fonctions transcendantes, in Oeuvres complètes de Niels Henrik Abel, vol. 1, Grøndahl, Christiana (Oslo), 1881, pp. 145–211.
F. Apéry and J.-P. Jouanolou, Élimination. Le cas d’une variable: Résultant et sous-résultants, Hermann, 2006.
E. Becker, M. Marinari, T. Mora, and C. Traverso, The shape of the Shape Lemma, Proc. ISSAC94, ACM, New York, 1994, pp. 129–133.
É. Bézout, Sur le degré des équations résultantes de l’évanouissement des inconnues, Hist. Acad. R. Sci. (1764), 288–338.
Winfried Bruns and Jürgen Herzog, Cohen-Macaulay rings, Cambridge Studies in Advanced Mathematics, vol. 39, Cambridge University Press, Cambridge, 1993. MR 1251956
P. Bikker and A. Yu. Uteshev, On the Bézout construction of the resultant, J. Symbolic Comput. 28 (1999), no. 1-2, 45–88. Polynomial elimination—algorithms and applications. MR 1709417, DOI 10.1006/jsco.1999.0267
J. Canny, Some algebraic and geometric computations in PSPACE, Twentieth ACM Symp. on Theory of Computing, 1988, pp. 460–467.
Marc Chardin, Formules à la Macaulay pour les sous-résultants en plusieurs variables, C. R. Acad. Sci. Paris Sér. I Math. 319 (1994), no. 5, 433–436 (French, with English and French summaries). MR 1296767
Marc Chardin, Multivariate subresultants, J. Pure Appl. Algebra 101 (1995), no. 2, 129–138. MR 1348031, DOI 10.1016/0022-4049(95)90926-C
David A. Cox, Solving equations via algebras, Solving polynomial equations, Algorithms Comput. Math., vol. 14, Springer, Berlin, 2005, pp. 63–123. MR 2161986, DOI 10.1007/3-540-27357-3_{2}
David Cox, John Little, and Donal O’Shea, Ideals, varieties, and algorithms, 3rd ed., Undergraduate Texts in Mathematics, Springer, New York, 2007. An introduction to computational algebraic geometry and commutative algebra. MR 2290010, DOI 10.1007/978-0-387-35651-8
David A. Cox, John Little, and Donal O’Shea, Using algebraic geometry, 2nd ed., Graduate Texts in Mathematics, vol. 185, Springer, New York, 2005. MR 2122859
Carlos D’Andrea and Martín Sombra, A Poisson formula for the sparse resultant, Proc. Lond. Math. Soc. (3) 110 (2015), no. 4, 932–964. MR 3335291, DOI 10.1112/plms/pdu069
M. Gallet, H. Rahkooy, and Z. Zafeirakopoulos, On computing the elimination ideal using resultants with applications to Gröbner bases, (2013) arXiv:1307.5330 [math.AC].
Joachim von zur Gathen and Thomas Lücking, Subresultants revisited, Theoret. Comput. Sci. 297 (2003), no. 1-3, 199–239. Latin American theoretical informatics (Punta del Este, 2000). MR 1981147, DOI 10.1016/S0304-3975(02)00639-4
Marc Giusti, Grégoire Lecerf, and Bruno Salvy, A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001), no. 1, 154–211. MR 1817612, DOI 10.1006/jcom.2000.0571
Laureano González-Vega, Determinantal formulae for the solution set of zero-dimensional ideals, J. Pure Appl. Algebra 76 (1991), no. 1, 57–80. MR 1140640, DOI 10.1016/0022-4049(91)90097-L
Patrizia Gianni and Teo Mora, Algebraic solution of systems of polynomial equations using Groebner bases, Applied algebra, algebraic algorithms and error-correcting codes (Menorca, 1987) Lecture Notes in Comput. Sci., vol. 356, Springer, Berlin, 1989, pp. 247–257. MR 1008541, DOI 10.1007/3-540-51082-6_{8}3
Walter Habicht, Zur inhomogenen Eliminationstheorie, Comment. Math. Helv. 21 (1948), 79–98 (German). MR 24417, DOI 10.1007/BF02568027
C. G. J. Jacobi, De eliminatione variabilis e duabus aequationibus algebraicis, J. Reine Angew. Math. 15 (1836), 101–124 (Latin). MR 1578091, DOI 10.1515/crll.1836.15.101
J.-P. Jouanolou, Le formalisme du résultant, Adv. Math. 90 (1991), no. 2, 117–263 (French). MR 1142904, DOI 10.1016/0001-8708(91)90031-2
Kiran S. Kedlaya, The algebraic closure of the power series field in positive characteristic, Proc. Amer. Math. Soc. 129 (2001), no. 12, 3461–3470. MR 1860477, DOI 10.1090/S0002-9939-01-06001-4
Wolfram Research, Inc., Mathematica, Version 13.0.0, Champaign, IL, 2021.
Angelos Mantzaflaris, Hamid Rahkooy, and Zafeirakis Zafeirakopoulos, Efficient computation of dual space and directional multiplicity of an isolated point, Comput. Aided Geom. Design 47 (2016), 114–129. MR 3545986, DOI 10.1016/j.cagd.2016.05.002
Angelos Mantzaflaris, Éric Schost, and Elias Tsigaridas, Sparse rational univariate representation, ISSAC’17—Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2017, pp. 301–308. MR 3703700, DOI 10.1145/3087604.3087653
F. J. Rayner, An algebraically closed field, Glasgow Math. J. 9 (1968), 146–151. MR 234941, DOI 10.1017/S0017089500000422
Fabrice Rouillier, Solving zero-dimensional systems through the rational univariate representation, Appl. Algebra Engrg. Comm. Comput. 9 (1999), no. 5, 433–461. MR 1697179, DOI 10.1007/s002000050114
Günter Scheja and Uwe Storch, The divisor of the resultant, Beiträge Algebra Geom. 37 (1996), no. 1, 149–159. MR 1407811
Günter Scheja and Uwe Storch, Regular sequences and resultants, Research Notes in Mathematics, vol. 8, A K Peters, Ltd., Natick, MA, 2001. MR 1831871, DOI 10.1201/9781439863657
J. J. Sylvester, A method of determining by mere inspection the derivatives from two equations of any degree, Philos. Mag. 16 (1840), 132–135; Mathematical Papers, vol. 1, Chelsea Publishing Co., New York, 1973, pp. 54–57.
Agnes Szanto, Solving over-determined systems by the subresultant method, J. Symbolic Comput. 43 (2008), no. 1, 46–74. With an appendix by Marc Chardin. MR 2381969, DOI 10.1016/j.jsc.2007.09.001