Abstract
We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets. If the polynomial system is zero dimensional, the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ritt J F. Differential Algebra. New York: American Mathematical Society, 1950
Wu W T. Basic principles of mechanical theorem proving in elementary geometries. J Sys Sci & Math Sci, 4: 20–235 (1984)
Chou S C, Mechanical Geometry Theorem-proving, Dordrecht: D. Reidel Pub. Company, 1988
Gao X S, Chou S C. The dimension of ascending chains. Chin Sci Bull, 38(5): 396–399 (1993)
Gao X S, Chou S C. Ritt-Wu’s decomposition algorithm and geometry theorem proving. In: Proceedings of CADE-10, Lecture Notes in Artificial Intelligence. 449: 207–220 (1990)
Wang D M. Elimination Method. Wien-New York: Springer-Verlag, (2001)
Gao X S, Chou S C. Solving parametric algebraic systems. In: Proceedings of ISSAC’92, 1992, 335–341
Trager B M. Algebraic factoring and rational function integration. In: Proceedings of ACM SYMSAC, 1976, 219–226
Yuan C M. Trager’s factorization algorithm over successive extension field. J Sys Sci & Math Scis, 26(5): 53–40 (2006)
Yang L, Zhang J Z. Searching dependency between algebraic equations: An algorithm applied to automated reasoning. In: Johnson J, McKee S, Vella A, eds. Artificial Intelligence in Mathematics. Oxford: Oxford University Press, 1994, 147–156
Kalbrener M. A generalized Euclidean algorithm for computing triangular representations of algebraic varieties. J Sym Comput, 15: 143–167 (1993)
Lazard D. A new method for solving algebraic systems of positive dimension. Discrete Appl Math, 33: 147–160 (1991)
Maza M M. On triangular decompositions of algebraic varieties. Technical Report TR 4/99, NAG Ltd, Oxford, UK, 1999
Aubry P, Lazard D, Maza M M. On the theories of triangular sets. J Sym Comput, 28: 105–124 (1999)
Szanto A. Computation with polynomial systems. Dissertation for the Doctoral Degree. Cornell: Cornell University, 1999
Kandri R A, Maarouf H, Ssafini M. Triviality and dimension of a system of algebraic differential equations. J Aut Rea, 20: 365–385 (1998)
Bouziane D, Kandri R A, Maarouf H. Unmixed-dimensional decomposition of a finitely generated perfect differential ideal. J Sym Comput, 31: 631–649 (2001)
Loos R. Computing in algebraic extensions. In: Buchberger B, Collins G E, Loos R, eds. Computer Algebra: Symbolic and Algebraic Computation. 2nd ed. Wien-New York: Springer-Verlag, 1983, 173–188
Cox D, Little J, Shea D O’. Ideals, Varieties, and Algorithms. 2nd ed. New York: Springer-Verlag, 1997, 149–159
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by the National Key Basic Research Project of China (Grant No. 2004CB31800)
Rights and permissions
About this article
Cite this article
Wang, Dk., Zhang, Y. An algorithm for decomposing a polynomial system into normal ascending sets. SCI CHINA SER A 50, 1441–1450 (2007). https://doi.org/10.1007/s11425-007-0118-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-007-0118-0