Gröbner bases and primary decomposition of polynomial ideals (Q1117277): Difference between revisions
From MaRDI portal
Revision as of 14:31, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gröbner bases and primary decomposition of polynomial ideals |
scientific article |
Statements
Gröbner bases and primary decomposition of polynomial ideals (English)
0 references
1988
0 references
An algorithm to compute the primary decomposition of ideals in a polynomial ring over a ``factorially closed algorithmic principal ideal domain'' (see the paper for the technical definition) is given. The construction is based on the Gröbner basis algorithm. Induction over the dimension is used and localization at principal primes lowers the dimension. In the zero-dimensional case Gröbner bases are again used for decomposing. Finally it is showed how the reduction process can be applied to computing radicals and testing for primality.
0 references
primary decomposition of ideals
0 references
factorially closed algorithmic principal ideal domain
0 references
Gröbner basis
0 references
computing radicals
0 references
testing for primality
0 references
