Commutative algebra Computational commutative algebra Concept
Multivariate division algorithm
Summary
The multivariate division algorithm divides a polynomial in several variables by an ordered list of polynomials, with respect to a fixed monomial order. It writes the polynomial as a combination of the divisors plus a remainder. No term of the remainder is divisible by the leading term of a divisor. It extends the division algorithm for polynomials in one variable. In general the remainder depends on the order of the divisors, but for a Gröbner basis it is unique, and it then decides ideal membership.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | T8EN3CAEQF |
|---|---|
| URI | m2://T8EN3CAEQF |
| Kind | concept |
| Writing | W0 stub |
| MSC | 13P10, 68W30 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.