Monomial orderings and Gröbner bases
- 2 January 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 25 (1) , 10-23
- https://doi.org/10.1145/122525.122526
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Admissible orders and linear formsACM SIGSAM Bulletin, 1987
- Algorithm 628ACM Transactions on Mathematical Software, 1985
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- Théorème de division et stabilité en géométrie analytique localeAnnales de l'institut Fourier, 1979
- On multiplication and factorization of polynomials, I. Lexicographic orderings and extreme aggregates of termsAequationes mathematicae, 1975
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Matrices of integers ordering derivativesTransactions of the American Mathematical Society, 1931