Groebner basis under composition II

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Groebner basis under composition II

Full text

Pdf (629 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1996 international symposium on Symbolic and algebraic computation table of contents

Zurich, Switzerland

Pages: 79 - 85

Year of Publication: 1996

ISBN:0-89791-796-0

Author

Hoon Hong

Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 11, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/236869.236906 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Thomas Becker , Volker Weispfenning , Heinz Kredel, Gro¨bner bases: a computational approach to commutative algebra, Springer-Verlag, London, 1993
	2	BUCHBERGER, B. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. PhD thesis, Universitat Innsbruck, Institut fur Mathematik, 1965. German.
	3	BUCHBERGER, B. Groebner bases: An algorithmic method in polynomial ideal theory. In Recent Trends in Multidimensional Systems Theory, N. K. Bose, Ed. D. Riedel Publ. Comp., 1985, ch. 6.
	4	CHAR, B. W., GEDDES, K. O., GONNET, G. H., AND WATT, S. M. Maple User's Guide, 4th ed. WATCOM Publications Limited, 1985.
	5	Cox, D., LITTLE, J., AND 6SHEA, D. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer Verlag, New York, Berlin, Heidelberg, 1992.
	6	J. C. Faugère , P. Gianni , D. Lazard , T. Mora, Efficient computation of zero-dimensional Gro¨bner bases by change of ordering, Journal of Symbolic Computation, v.16 n.4, p.329-344, Oct. 1993 [doi>10.1006/jsco.1993.1051]
	7	P. Gianni , T. Mora, Algebraic solution of systems of polynomial equations using Groebner bases, Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.247-257, June 1987, Menorca, Spain
	8	HONG, H. Groebner basis Under Composition. Tech. Rep. 95-55, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1995. Submitted for publication.
	9	HONG, H. Multivariate Resultants Under Composition. Tech. Rep. 95-56, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1995. Submitted for publication.
	10	Hoon Hong, Subresultants under composition, Journal of Symbolic Computation, v.23 n.4, p.355-365, April 1997 [doi>10.1006/jsco.1996.0093]
	11	Bhubaneswar Mishra, Algorithmic algebra, Springer-Verlag New York, Inc., New York, NY, 1993
	12	Lorenzo Robbiano, On the theory of graded structures, Journal of Symbolic Computation, v.2 n.2, p.139-170, June 1986 [doi>10.1006/jsco.1996.0006]
	13	Volker Weispfenning, Admissible orders and linear forms, ACM SIGSAM Bulletin, v.21 n.2, p.16-18, May 1987 [doi>10.1145/24554.24557]

CITED BY 4

	Wang Mingsheng , Liu Zhuojun, Remarks on Gröbner basis for ideals under composition, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.237-244, July 2001, London, Ontario, Canada
	Jinwang Liu , Zhuojun Liu , Mingsheng Wang, The term orderings which are compatible with composition II, Journal of Symbolic Computation, v.35 n.2, p.153-168, February 2003
	Patrik Nordbeck, SAGBI bases under composition, Journal of Symbolic Computation, v.33 n.1, p.67-76, 01/01/2002
	Wei Pan , Dongming Wang, Uniform Gröbner bases for ideals generated by polynomials with parametric exponents, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy