On the theories of triangular sets

Journal of Symbolic Computation

Volumn 28, Issue 1-2, 1999, Pages 105-124

  Aubry, Philippe ^a   Lazard, Daniel ^a   Moreno Maza, Marc ^a,b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b Numerical Algorithms Group   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001308767     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1999.0269     Document Type: Article

References (32)

1. Aubry, P., Moreno Maza, M. (1997). Triangular sets for solving polynomial systems: a comparative implementation of four methods. J. Symb. Comput., 28 125-154
2. Boulier, F., Lazard, D., Ollivier, F., Petitot, M. (1995). Representation for the radical of a finitely generated differential ideal. In Proceedings of ISSAC'95, Montréal, Canada, pp. 158-166.
3. Boulier, F., Lazard, D., Ollivier, F., Petitot, M. (1997). Computing representations for radicals of finitely generated differential ideals. Technical Report, ref. IT-306, Université Lille I, 59655, Villeneuve d'Ascq, France.
4. Bourbaki, N. (1961). Algèbre Commutative, chapter 2. Paris, Herman.
5. Chou, S., Gao, X. (1990). Ritt-Wu's decomposition algorithm and geometry theorem proving. In Proceedings CADE-10, Kaiserslautern, Germany, pp. 202-220.
6. Chou, S., Gao, X. (1991a). Computations with parametric equations. In Proceedings ISAAC'91, Bonn, Germany, pp. 122-127.
7. Chou, S., Gao, X. (1991b). On the dimension of an arbitrary ascending chain. Chin. Bull. Sci., 38, 799-804.
8. Chou, S., Gao, X. (1992). Solving parametric algebraic systems. In Proceedings ISAAC'92, Berkeley, CA, pp. 335-341.
9. Cox, D., Little, J., O'Shea, D. (1992). Ideals, Varieties, and Algorithms. New York, Springer-Verlag.
10. Gallo, G., Mishra, B. (1990). Efficient algorithms and bounds for Wu-Ritt characteristic sets. In Proceedings MEGA'90, pp. 119-142.
11. Gallo, G., Mishra, B. (1991). Wu-Ritt characteristic sets and their complexity. In Goodman, J.E., Pollack, R. and Steiger, W., eds, Discrete and Computational Geometry: Papers from the DIMACS Special Year, volume 6, Dimacs Series in Discrete Mathematics and Theoretical Computer Science, pp. 111-136. American Mathematical Society and Association for Computing Machinery.
12. Kalkbrener, M. (1991). Three contributions to elimination theory. Ph.D. Thesis, Johannes Kepler University, Linz.
13. Kalkbrener, M. (1993). A generalized euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comput., 15, 143-167.
14. Kalkbrener, M. (1998). Algorithmic properties of polynomial rings. J. Symb. Comput., 26, 525-581.
15. Lazard, D. (1991a). A new method for solving algebraic systems of positive dimension. Discrete Appl. Math., 33, 147-160.
16. Lazard, D. (1991b). Systems of algebraic equations (algorithms and complexity). In Eisenbud, D. and Robbiano, L., eds, Cortona Proceedings. Cambridge, Cambridge University Press.
17. Lazard, D. (1992). Solving zero-dimensional algebraic systems. J. Symb. Comput., 15, 117-132.
18. Moreno Maza, M. (1997). Calculs de Pgcd au-dessus des Tours d'Extensions Simples et Résolution des Systèmes d'Équations Algébriques. Ph.D. Thesis, Université Paris 6.
19. Moreno Maza, M., Rioboo, R. (1995). Polynomial gcd computations over towers of algebraic extensions. In Cohen G., Giusti M. and Mora T., eds, Proceedings AAECC-11, pp. 365-382. Berlin, Springer.
20. Ritt, J. (1932). Differential Equations from an Algebraic Standpoint, volume 14. New York, American Mathematical Society.
21. Ritt, J. (1966). Differential Algebra. New York, Dover Publications.
22. Samuel, P., Zariski, O. (1967). Commutative Algebra. D. Van Nostrand Company.
23. Wang, D. M. (1992). Some improvements on Wu's method for solving systems of algebraic equations. In Wen-Tsün, W. and Min-De, C., eds, Proc. of the Int. Workshop on Math. Mechanisation, Beijing, China,. Institute of Systems Science, Academia Sinica.
24. Wang, D. M. (1993). An elimination method for polynomial systems. J. Symb. Comput., 16, 83-114.
25. Wang, D. M. (1995). An implementation of the characteristic set method in Maple. In Pfalzgraf, J. and Wang, D. M., eds, Automated Practical Reasoning: Algebraic Approaches, pp. 187-201. Wien, Springer.
26. Wang, D. M. (1998a). Decomposing polynomial systems into simple systems. J. Symb. Comput., 25, 295-314.
27. Wang, D. M. (1998b). Elimination Methods. Springer-Verlag, Wien, Springer-Verlag (in press).
28. Wu, W. T. (1984a). Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. Sci., 4, 207-235.
29. Wu, W. T. (1984b). Some recent advances in mechanical theorem-proving of geometries. In Bledsoe, W. W. and Loveland, P.W., eds, Automated Theorem Proving: After 25 Years. Providence, RI, American Mathematical Society, pp. 235-241.
30. Wu, W. T. (1986). On zeros of algebraic equations - an application of Ritt principle. Kexue Tongbao, 31, 1-5.
31. Wu, W. T. (1987). A zero structure theorem for polynomial equations solving. MM Research Preprints, 1, 2-12.
32. Yang, L., Zhang, J. (1994). Searching dependency between algebraic equations: an algorithm applied to automated reasoning. In Johnson, J., McKee, S. and Vella, A., eds, Artificial Intelligence in Mathematics, pp. 147-156. Oxford, Oxford University Press.