Commutative algebra Computational commutative algebra Concept
Monomial order
Summary
A monomial order is a total order on the monomials of a polynomial ring that is compatible with multiplication and has no infinite descending chains. It singles out a leading term in every nonzero polynomial, which is what makes the multivariate division algorithm and Gröbner bases work. Common examples are the lexicographic order, the graded lexicographic order and the graded reverse lexicographic order.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | E874NARWPV |
|---|---|
| URI | m2://E874NARWPV |
| Kind | concept |
| Writing | W0 stub |
| MSC | 13P10, 06A05 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.