Commutative algebra Computational commutative algebra Concept
Regular chain
Summary
A regular chain is a triangular set of polynomials, with one polynomial for each of some of the variables. In it, the leading coefficient of each polynomial is not a zero divisor modulo the ideal described by the earlier polynomials. Regular chains describe the solution sets of polynomial systems in a triangular form that can be solved one variable at a time. Every polynomial system can be decomposed into finitely many regular chains, and this gives an alternative to Gröbner bases in computer algebra.
Further reading
About this page
| Tag | 1ZA98AGKGK |
|---|---|
| URI | m2://1ZA98AGKGK |
| Kind | concept |
| Writing | W0 stub |
| MSC | 13P15, 13P10, 68W30 |
| Same as | |
| 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.