Admissible term orderings used in computer algebra systems
- 3 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 22 (1) , 28-31
- https://doi.org/10.1145/43882.43887
Abstract
Recently a discusion on correctness of Gröbner bases computation arised with H. M. Möller. We found that almost any implementation of Buchberger's algorithm to compute Gröbner bases defines and uses its own ordering of power products. We summarize the definitions of the most important ones, and include 4 examples to illustrate the differencies.Keywords
This publication has 5 references indexed in Scilit:
- Applying Quantifier Elimination to the Birkhoff Interpolation ProblemJournal of Symbolic Computation, 1996
- Admissible orders and linear formsACM SIGSAM Bulletin, 1987
- Algorithm 628ACM Transactions on Mathematical Software, 1985
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal TheoryPublished by Springer Nature ,1985
- Über B. Buchbergers verfahren, systeme algebraischer gleichungen zu lösenJournal of Number Theory, 1978