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.
Publisher
Association for Computing Machinery (ACM)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A combinatorial result on Gr�bner Fans with an application to universal Gr�bner bases;Applicable Algebra in Engineering, Communication and Computing;1996-09
2. An algorithm for determining the size of symmetry groups;Computing;1992-06
3. On the number of term orders;Applicable Algebra in Engineering, Communication and Computing;1991-03
4. Polyelectrolyte Membranes;Polyelectrolytes with Defined Molecular Architecture I