Groebner basis under composition I

Journal of Symbolic Computation

Volumn 25, Issue 5, 1998, Pages 643-663

  Hong, Hoon ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (17)

1. Barton, D., Zippel, R. (1985). Polynomial decomposition algorithms. J. Symb. Comput. 1, 159-168.
2. Becker, T., Weispfenning, V. (1993). Gröbner Bases - A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics. New York: Springer.
3. Binder, F. (1996). Fast computations in the lattice of polynomial rational function fields. In ISSAC-96, pp. 43-48. New York: ACM Press.
4. Buchberger, B. (1965). An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal . PhD thesis, Universitat Innsbruck, Institut fur Mathematik. In German.
5. Buchberger, B. (1985). Groebner bases: an algorithmic method in polynomial ideal theory. In Bose, N.K. ed., Recent Trends in Multidimensional Systems Theory, Chapter 6. Dordrecht: D. Riedel.
6. Cheng, C., McKay, J. H., Wang, S. (1995). A chain rule for multivariate resultants. Proc. Amer. Math. Soc. 123, 1037-1047.
7. Cox, D., Little, J., ÓShea, D. (1992). Ideals, Varieties, and Algorithms, Undergraduate Texts in Mathematics. New York: Springer.
8. Hong, H. (1995). Multivariate resultants under composition. Technical Report 95-56, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria. Submitted for publication.
9. Hong, H. (1996). Groebner basis under composition II. In Proceedings of ISSAC 96 (International Symposium on Symbolic and Algebraic Computation), pp. 79-85. New York: ACM Press.
10. Hong, H. (1997). Subresultant under composition. J. Symb. Comput. 23, 355-365.
11. Kozen, D., Landau, S. (1989). Polynomial decomposition algorithms. J. Symb. Comput. 7, 445-456.
12. McKay, J., Wang, S. (1989). A chain rule for the resultant of two polynomials. Arch. Math. 53, 347-351.
13. Ritter, G., Weispfenning, V. (1991). On the number of term orders. Applic. Algeb. Eng. Comm. Comput. 2, 55-79.
14. Robbiano, L. (1986). On the theory of graded structures. J. Symb. Comput. 2, 139-170.
15. Von zur Gathen, J. (1990a). Functional decomposition of polynomials: the tame case. J. Symb. Comput. 9, 281-300.
16. Von zur Gathen, J. (1990b). Functional decomposition of polynomials: the wild case. J. Symb. Comput. 10, 437-452.
17. Weispfenning, V. (1987). Admissible orderings and linear forms. SIGSAM Bulletin 21, 16-18.