Computing minimal associated primes in polynomial rings over the integers (Q719750): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Ginv / rank | |||
Normal rank | |||
Revision as of 23:17, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing minimal associated primes in polynomial rings over the integers |
scientific article |
Statements
Computing minimal associated primes in polynomial rings over the integers (English)
0 references
11 October 2011
0 references
The paper concerns the problem of computing the minimal associated primes of an ideal in a polynomial ring over the integers. The present algorithm avoids the computation of a Gröbner basis over the integers, which is often the bottleneck of other known algorithms. The main idea is replacing computations over the integers by several computations over the rationals and finite fields. Example with timings are provided.
0 references
minimal associated primes
0 references
primary decomposition
0 references
