Monomial representations for Gröbner bases computations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Monomial representations for Gröbner bases computations

Full text

Pdf (300 KB)

Source

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

Rostock, Germany

Pages: 309 - 316

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Olaf Bachmann	Centre for Computer Algebra, Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany
Hans Schönemann	Centre for Computer Algebra, Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
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): 3, Downloads (12 Months): 16, Citation Count: 2

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/281508.281657 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	Giuseppe Attardi , Tito Flagella, Memory management in the PoSSo solver, Journal of Symbolic Computation, v.21 n.3, p.293-311, March 1996 [doi>10.1006/jsco.1996.0013]
	2	BACHMANN, O., AND SCH6NEMANN, H. Monomial operations for computations of GrSbner bases. In Reports On Computer Algebra, no. 18. Centre for Computer Algebra, University of Kaiserslautern, January 1998. Also available from http : //www. mathemat ik. uni-kl, de / ~zca/
	3	BAYER, D., AND MUMFORD, D. What can be computed in algebraic geometry? Cambridge University Press, Cambridge, 1993, pp. 1-48.
	4	BAYER, D., AND STILLMAN, M. A theorem on refining division orders by the revers lexicographic order. Duke J. Math. 55 (1987), 321-328.
	5	BAYER, D., AND STILLMAN, M. Macaulay Classic: A computer algebra system for algebraic geometry, 1993. Available via anonymous ftp from ftp://math, harvard, edu/Macaulay.
	6	BUCHBERGER, B. Groebner bases: an algorithmic method in polynomial ideal theory. D. Reidel Publishing Company, 1985, pp. 184-232.
	7	Massimo Caboara , Gabriel de Dominicis , Lorenzo Robbiano, Multigraded Hilbert functions and Buchberger algorithm, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.72-78, July 24-26, 1996, Zurich, Switzerland [doi>10.1145/236869.236901]
	8	COX, D., LITTLE, J., AND O'SHEA, D. Ideals, Varieties, and Algorithms, 2nd ed. Springer-Verlag, 1997.
	9	Alessandro Giovini , Teo Mora , Gianfranco Niesi , Lorenzo Robbiano , Carlo Traverso, “One sugar cube, please” or selection strategies in the Buchberger algorithm, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.49-54, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120701]
	10	GREUEL, G.-M., PFISTER, G., AND SCHONEMANN, H. Singular Reference Manual. In Reports On Computer Algebra, no. 12. Centre for Computer Algebra, University of Kaiserslautern, May 1997. http ://www. mathematik, uni-kl, de/~zca/Singular
	11	PoSSo: Polynomial System Solving, 1995. http://posso, dm. unipi, it/.
	12	Lorenzo Robbiano, Term Orderings on the Polynominal Ring, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.513-517, April 01-03, 1985

CITED BY 2

	Viktor Levandovskyy , Hans Schönemann, Plural: a computer algebra system for noncommutative polynomial algebras, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.176-183, August 03-06, 2003, Philadelphia, PA, USA
	Michael Brickenstein , Alexander Dreyer, PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials, Journal of Symbolic Computation, v.44 n.9, p.1326-1345, September, 2009