A concise proof of the Kronecker polynomial system solver from scratch

Expositiones Mathematicae

Volumn 26, Issue 2, 2008, Pages 101-139

  Durvye, Clémence ^a   Lecerf, Grégoire ^b  

^a UNIVERSITÉ DE VERSAILLES SAINT QUENTIN EN YVELINES   (France)

^b INDEPENDENT UNIVERSITY OF MOSCOW   (Russian Federation)

Author keywords

Algorithm; Complexity; Elimination theory; Polynomial system solving

Indexed keywords

EID: 41549114724     PISSN: 07230869     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.exmath.2007.07.001     Document Type: Article

References (72)

1. M.-E. Alonso, E. Becker, M.-F. Roy, T. Wörmann, Zeros, multiplicities, and idempotents for zero-dimensional systems, Algorithms in Algebraic Geometry and Applications. Proceedings of MEGA'94, Progress in Mathematics, vol. 143, Birkhäuser, 1996, pp. 1-15.
2. Bank B., Giusti M., Heintz J., and Mbakop G.M. Polar varieties, real equation solving, and data structures: the hypersurface case. J. Complexity 13 1 (1997) 5-27
3. Bank B., Giusti M., Heintz J., and Mbakop G.M. Polar varieties and efficient real elimination. Math. Z. 238 1 (2001) 115-144
4. Bank B., Giusti M., Heintz J., and Pardo L.M. Generalized polar varieties and an efficient real elimination procedure. Kybernetika (Prague) 40 5 (2004) 519-550
5. Becker T., and Weispfenning V. Gröbner bases. A computational approach to commutative algebra, Graduate Texts in Mathematics vol. 141 (1993), Springer, Berlin
6. Bompadre A., Matera G., Wachenchauzer R., and Waissbein A. Polynomial equation solving by lifting procedures for ramified fibers. Theoret. Comput. Sci. 315 2-3 (2004) 334-369
7. A. Bostan, G. Lecerf, B. Salvy, É. Schost, B. Wiebelt, Complexity issues in bivariate polynomial factorization, Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ACM, 2004, pp. 42-49.
8. Bruno N., Heintz J., Matera G., and Wachenchauzer R. Functional programming concepts and straight-line programs in computer algebra. Math. Comput. Simulation 60 6 (2002) 423-473
9. Bürgisser P., Clausen M., and Shokrollahi M.A. Algebraic Complexity Theory (1997), Springer, Berlin
10. Cafure A., and Matera G. Fast computation of a rational point of a variety over a finite field. Math. Comp. 75 256 (2006) 2049-2085
11. Cafure A., and Matera G. Improved explicit estimates on the number of solutions of equations over a finite field. Finite Fields Appl. 12 2 (2006) 155-185
12. L. Caniglia, A. Galligo, J. Heintz, Some new effectivity bounds in computational geometry, Applied algebra, algebraic algorithms and error-correcting codes (Rome, 1988), Lecture Notes in Computer Science, vol. 357, Springer, Berlin, 1989, pp. 131-151.
13. Castaño B., Heintz J., Llovet J., and Martínez R. On the data structure straight-line program and its implementation in symbolic computation. Math. Comput. Simulation 51 5 (2000) 497-528
14. Castro D., Giusti M., Heintz J., Matera G., and Pardo L.M. The hardness of polynomial equation solving. Found. Comput. Math. 3 4 (2003) 347-420
15. Castro D., Montaña J.L., Pardo L.M., and San Martín J. The distribution of condition numbers of rational data of bounded bit length. Found. Comput. Math. 2 1 (2002) 1-52
16. Castro D., Pardo L.M., Hägele K., and Morais J.E. Kronecker's and Newton's approaches to solving: a first comparison. J. Complexity 17 1 (2001) 212-303
17. Castro D., Pardo L.M., and San Martín J. Systems of rational polynomial equations have polynomial size approximate zeros on the average. J. Complexity 19 2 (2003) 161-209
18. Chèze G., and Lecerf G. Lifting and recombination techniques for absolute factorization. J. Complexity 23 3 (2007) 380-420
19. D.A. Cox, J. Little, D. O'Shea, Ideals varieties and algorithms. An introduction to computational algebraic geometry and commutative algebra, second ed., Undergraduate Texts in Mathematics, Springer, Berlin, 1997.
20. D.A. Cox, J. Little, D. O'Shea, Using algebraic geometry, second ed., Graduate Texts in Mathematics, Springer, Berlin, 2005.
21. De Leo M., Dratman E., and Matera G. Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study. J. Complexity 21 4 (2005) 502-531
22. M. Demazure, Réécriture et bases standard, Notes informelles de calcul formel. Centre de Mathématiques, École polytechnique, Palaiseau, France, 1985, http://www.stix.polytechnique.fr/publications/1984-1994.html.
23. Eisenbud D. Commutative algebra. With a view toward algebraic geometry, Graduate Texts in Mathematics (1995), Springer, Berlin
24. N. Fitchas, M. Giusti, F. Smietanski, Sur la complexité du théorème des zéros, Approximation and optimization in the Caribbean, II (Havana, 1993), Approximation and Optimization, vol. 8, Lang, Frankfurt am Main, 1995, pp. 274-329.
25. von zur Gathen J., and Gerhard J. Modern Computer Algebra. second ed. (2003), Cambridge University Press
26. Gaudry P., and Schost E. Modular equations for hyperelliptic curves. Math. Comp. 74 249 (2005) 429-454
27. Giusti M., Hägele K., Heintz J., Montaña J.L., Morais J.E., and Pardo L.M. Lower bounds for Diophantine approximations. J. Pure Appl. Algebra 117/118 (1997) 277-317
28. Giusti M., Hägele K., Lecerf G., Marchand J., and Salvy B. The projective Noether Maple package: computing the dimension of a projective variety. J. Symbolic Comput. 30 3 (2000) 291-307
29. M. Giusti, J. Heintz, 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), Symposium on Mathematics, XXXIV, Cambridge University Press, 1993, pp. 216-256.
30. M. Giusti, J. Heintz, Kronecker's smart, little black boxes, Foundations of Computational Mathematics (Oxford, 1999), London Mathematical Society Lecture Note Series, vol. 284, Cambridge University Press, 2001, pp. 69-104.
31. 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
32. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, When polynomial equation systems can be "solved" fast?, Applied algebra, algebraic algorithms and error-correcting codes (Paris, 1995), Lecture Notes in Computer Science, vol. 948, Springer, Berlin, 1995, pp. 205-231.
33. Giusti M., Heintz J., Morais J.E., and Pardo L.M. Le rôle des structures de données dans les problèmes d'élimination. C. R. Acad. Sci. Paris Sér. I Math. 325 11 (1997) 1223-1228
34. Giusti M., Heintz J., and Sabia J. On the efficiency of effective Nullstellensätze. Comput. Complexity 3 1 (1993) 56-95
35. Giusti M., Lecerf G., and Salvy B. A Gröbner free alternative for polynomial system solving. J. Complex. 17 1 (2001) 154-211
36. M. Giusti, É. Schost, Solving some overdetermined polynomial systems. Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ACM, 1999, pp. 1-8.
37. Greuel G.-M., and Pfister G. A Singular Introduction to Commutative Algebra (2002), Springer, Berlin
38. K. Hägele, Intrinsic height estimates for the Nullstellensatz, Ph.D. Thesis, Universidad de Cantabria, Santander, Spain, 1998.
39. Hägele K., Morais J.E., Pardo L.M., and Sombra M. On the intrinsic complexity of the arithmetic Nullstellensatz. J. Pure Appl. Algebra 146 2 (2000) 103-183
40. Heintz J., Krick T., Puddu S., Sabia J., and Waissbein A. Deformation techniques for efficient polynomial equation solving. J. Complexity 16 1 (2000) 70-109
41. Heintz J., Matera G., Pardo L.M., and Wachenchauzer R. The intrinsic complexity of parametric elimination methods. Electronic J. of SADIO 1 1 (1998) 37-51
42. Heintz J., Matera G., and Waissbein A. On the time-space complexity of geometric elimination procedures. Appl. Algebra Engrg. Comm. Comput. 11 4 (2001) 239-296
43. Horn R.A., and Johnson C.R. Topics in Matrix Analysis (1994), Cambridge University Press Corrected reprint of the 1991 original
44. Jeronimo G., Krick T., Sabia J., and Sombra M. The computational complexity of the Chow form. Found. Comput. Math. 4 1 (2004) 41-117
45. G. Jeronimo, G. Matera, P. Solerno, A. Waissbein, Deformation techniques for sparse systems, arXiv:math/0608714v1, 2006.
46. Jeronimo G., Puddu S., and Sabia J. Computing Chow forms and some applications. J. Algorithms 41 1 (2001) 52-68
47. Jeronimo G., and Sabia J. Probabilistic equidimensional decomposition. C. R. Acad. Sci. Paris Sér. I Math. 331 6 (2000) 485-490
48. Jeronimo G., and Sabia J. Effective equidimensional decomposition of affine varieties. J. Pure Appl. Algebra 169 2-3 (2002) 229-248
49. T. Krick, L.M. Pardo, A computational method for diophantine approximation, Algorithms in algebraic geometry and applications (Santander, 1994), Progress in Mathematics, vol. 143, Birkhäuser, 1996, pp. 193-253.
50. Kronecker L. Grundzüge einer arithmetischen Theorie der algebraischen Grössen. J. reine angew. Math. 92 (1882) 1-122
51. S. Lang, Algebra, third ed., Graduate Texts in Mathematics, vol. 211, Springer, Berlin, 2002.
52. G. Lecerf, Kronecker, a Magma Package for Polynomial System Solving, http://www.math.uvsq.fr/∼lecerf.
53. G. Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, ACM, 2000, pp. 209-216.
54. G. Lecerf, Une alternative aux méthodes de réécriture pour la résolution des systèmes algébriques, Ph.D. Thesis, École polytechnique, Palaiseau, France, 2001.
55. Lecerf G. Quadratic Newton iteration for systems with multiplicity. Found. Comput. Math. 2 3 (2002) 247-293
56. Lecerf G. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. Complexity 19 4 (2003) 564-596
57. Lecerf G. Sharp precision in Hensel lifting for bivariate polynomial factorization. Math. Comp. 75 (2006) 921-933
58. Lecerf G. Improved dense multivariate polynomial factorization algorithms. J. Symbolic Comput. 42 4 (2007) 477-494
59. L. Lehmann, Polar varieties, real elimination and wavelet design, 2004, Talk given at Dagstuhl Seminar 04061 on Real Computation and Complexity.
60. Mallat S. Foveal detection and approximation for singularities. Appl. Comput. Harmon. Anal. 14 2 (2003) 133-180
61. Matera G. Probabilistic algorithms for geometric elimination. Appl. Algebra Engrg. Comm. Comput. 9 6 (1999) 463-520
62. Mora T. Solving Polynomial Equation Systems. I The Kronecker-Duval Philosophy, Encyclopedia of Mathematics and its Applications vol. 88 (2003), Cambridge University Press
63. J.E. Morais, Resolución eficaz de sistemas de ecuaciones polinomiales, Ph.D. Thesis, Universidad de Cantabria, Santander, Spain, 1997.
64. L.M. Pardo, How lower and upper complexity bounds meet in elimination theory, Applied algebra, algebraic algorithms and error-correcting codes (Paris, 1995), Lecture Notes in Computer Science, vol. 948, Springer, Berlin, 1995, pp. 33-69.
65. Pardo L.M., and San Martin J. Deformation techniques to solve generalised Pham systems. Theoret. Comput. Sci. 315 2-3 (2004) 593-625
66. Rouillier F. Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Engrg. Comm. Comput. 6 (1996) 353-376
67. M. Safey El Din, Finding sampling points on real hypersurfaces is easier in singular situations, Proceedings of Effective Methods in Algebraic Geometry, 2005.
68. Safey El Din M., and Schost E. Properness defects of projections and computation of at least one point in each connected component of a real algebraic set. Discrete Comput. Geom. 32 3 (2004) 417-430
69. Schost E. Computing parametric geometric resolutions. Appl. Algebra Engrg. Comm. Comput. 13 5 (2003) 349-393
70. Shafarevich I.R. Basic Algebraic Geometry. 1 Varieties in Projective Space. second ed. (1994), Springer, Berlin
71. A.J. Sommese, J. Verschelde, C.W. Wampler, Solving polynomial systems equation by equation in the IMA volume on algorithms in algebraic geometry, Springer, New York, to appear.
72. Wang D. Elimination Practice. Software Tools and Applications (2004), Imperial College Press, London