Theory of linear and integer programming
Theory of linear and integer programming
Admissible orders and linear forms
ACM SIGSAM Bulletin
Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Term Orderings on the Polynominal Ring
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Scratchpad II: An Abstract Datatype System for Mathematical Computation
Proceedings of the International Symposium on Trends in Computer Algebra
Reduction and completion algorithms for partial differential equations
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Rankings of partial derivatives
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On The Diversity Of Orderings On Strings
Fundamenta Informaticae
| Hi-index | 0.00 |
Let there be given a set of monomials in n variables and some order relations between them. The following fundamental problem of monomial ordering is considered. Is it possible to decide whether these ordering relations are consistent and if so to extend them to an admissible ordering for all monomials? The answer is given in terms of the algorithm MACOT which constructs a matrix of so called cotes which establishes the desired ordering relations. The main area of application of this algorithm, i.e. the construction of Gröbner bases for different orderings and of universal Gröbner bases is treated in the last section.