Lifting techniques for triangular decompositions

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2005, Issue , 2005, Pages 108-115

  Dahan, Xavier ^a   Moreno Maza, Marc ^b   Schost, Éric ^a   Wu, Wenyuan ^c   Xie, Yuzhen ^c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

^c UWO ^*  (Canada)

Author keywords

Hensel lifting; Polynomial systems; Triangular sets

Indexed keywords

HENSEL LIFTING; POLYNOMIAL SYSTEMS; TRIANGULAR SETS;

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

SET THEORY;

EID: 33748961047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. E. A. Arnold. Modular algorithms for computing Gröbner bases. J. Symb. Comp., 35(4):403-419, 2003.
2. P. Aubry and A. Valibouze. Using Galois ideals for computing relative resolvents, J. Symb. Comp., 30(6):635-651, 2000.
3. F. Boulier, L. Denis-Vidal, T. Honin, and F. Lemaire. Lépisme. In ICPSS, pages 23-27. University of Paris 6, France, 2004.
4. F. Boulier and F. Lemaire. Computing canonical representatives of regular differential ideals. In ISSAC 2000, pages 37-46, ACM Preas, 2000.
5. X. Dahan. Borne de hauteur (polynomiale) sur les coefficients d'une représentation triangnlairo d'une variété zéro-dlrnensionnelle présentant des symétries. Master's thesis, École Polytechnique, 2003.
6. X. Dahan, M. Moreno Maza, É. Schost, W. Wu, and Y. Xie, The complexity of the Split-and-Merge algorithm. In preparation.
7. X. Dahan, M. Moreno Maza, É. Schost, W. Wu, and Y. Xio. On the complexity of the D5 principle. Preprint.
8. X. Dahan, M. Moreno Maza, É. Schost, W. Wu, and Y. Xie. Equiprojectable decompositions of zero-dimensional varieties. In ICPSS, pages 08-71. University of Paris 6, France, 2004.
9. X. Dahan and É, Schost. Sharp estimates for triangular seta. In ISSAC 04, pages 103-110. ACM Press, 2004.
10. D. Eisenbud. Commutative algebm, volume 150 of GTM. Springer-Verlag, 1090.
11. M.V. Fournov and M. Moreno Maza. On computer-assisted classification of coupled integrable equations, J. Symb. Comp., 33:647-660, 2002.
12. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
13. M. Giusti, J. Heintz, J. E. Morais, and L. M. Pardo. When polynomial equation systems can be solved fast? In AAECC-11, pages 205-231. Springer, 1995.
14. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial System solving. J. Complexity, 17(1):154-211, 2001.
15. É. Hubert, Notes on triangular sets and triangulation-decomposition algorithms, In Symbolic and Numerical Scientific Computations, volume 2630 of LNCS, pages 1-39, Springer, 2003.
16. M. Kalkbrener. A generalized euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comp., 15:143-167, 1093.
17. T. Krick, L. M. Pardo, and M. Sombra. Sharp estimates for the arithmetic Nullstellensatz, Duke Math. J., 109(3):521-598, 2001.
18. D. Lazard, Solving zero-dimensional algebraic systems. J. Symb. Comp., 13:117-133, 1992.
19. F. Lemaire, M. Moreno Maza, and Y. Xie. The RegularChains library. In Maple 10, Maplosoft, Canada. To appear.
20. P. J. McCarthy, Algebraic extensions of fields. Dover, New York, 1991.
21. M. Moreno Maza. On triangular decompositions of algebraic varieties. Technical Report 4/99, NAG, UK, Presented at the MEGA-2000 Conference, Bath, UK. http://www.csd.uwo.ca/~moreno.
22. M. Moreno Maza and R. Rioboo. Polynomial gcd computations over towers of algebraic extensions. In Proc. AAECC-11, pages 365-382. Springer, 1995.
23. F. Rouilller. Solving zero-dimensional systems through the rational univarlate representation. AAECC, 9:433-461, 1999.
24. É. Schost, Complexity results for triangular sots. J. Symb. Camp., 36(3-4):555-594, 2003.
25. The symbolicdata project, 2000-2002. http://www.SymbolicData.org.
26. W. Trinks. On improving approximate results of Buchherger's algorithm by Newton's method. In EUROCAL 85, volume 203 of LNCS, pages 608-611. Springer, 1985.