An algorithm for primary decomposition in polynomial rings over the integers
From MaRDI portal
Abstract: We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and the idea of Shimoyama-Yokoyama resp. Eisenbud-Hunecke-Vasconcelos to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in SINGULAR. Examples and timings are given at the end of the article.
Recommendations
- An algorithm to compute a primary decomposition of modules in polynomial rings over the integers
- New algorithms for computing primary decomposition of polynomial ideals
- scientific article; zbMATH DE number 1302473
- Algorithm for primary submodule decomposition without producing intermediate redundant components
- Localization and primary decomposition of polynomial ideals
Cites work
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- Binomial ideals
- Constructions in a Polynomial Ring Over the Ring of Integers
- Direct methods for primary decomposition
- Gröbner bases and primary decomposition of polynomial ideals
- Localization and primary decomposition of polynomial ideals
- SINGULAR
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- The Gröbner basis of the ideal of vanishing polynomials
- The decomposition theorem for ideals in polynomial rings over a domain
Cited in
(11)- An algorithm to compute a primary decomposition of modules in polynomial rings over the integers
- An algorithm for polynomial multiplication that does not depend on the ring constants
- Primary decomposition of squarefree pseudomonomial ideals
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras
- New algorithms for computing primary decomposition of polynomial ideals
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Computing minimal associated primes in polynomial rings over the integers
- Primary decomposition of symmetric ideals
- Implementation of a primary decomposition package
- Prime decompositions of radicals in polynomial rings
- Decomposing finite \(\mathbb{Z}\)-algebras
This page was built for publication: An algorithm for primary decomposition in polynomial rings over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657376)
