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.
A new algorithm for primary decomposition in polynomial rings over the integers is presented. It makes essential use of primary decomposition over the rationals and over finite fields. Other algorithms can be found in [\textit{A. Seidenberg}, Am. J. Math. 100, 685--706 (1978; Zbl 0416.13013)], [\textit{P. Gianni}, \textit{B. Trager}, and \textit{G. Zacharias}, J. Symb. Comp. 6, No. 2--3, 149--167 (1988; Zbl 0667.13008)], and [\textit{C. W. Ayoub}, J. Algebra 76, 99--110 (1982; Zbl 0505.13005)].
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
- 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
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- Localization and primary decomposition of polynomial ideals
- SINGULAR
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- The decomposition theorem for ideals in polynomial rings over a domain
- The Gröbner basis of the ideal of vanishing polynomials
Cited in
(13)- Prime decompositions of radicals in polynomial rings
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Implementation of a primary decomposition package
- An algorithm for polynomial multiplication that does not depend on the ring constants
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- An algorithm to compute a primary decomposition of modules in polynomial rings over the integers
- New algorithms for computing primary decomposition of polynomial ideals
- Primary decomposition of squarefree pseudomonomial ideals
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras
- Primary decomposition of symmetric ideals
- Decomposing finite \(\mathbb{Z}\)-algebras
- Localization and primary decomposition of polynomial ideals
- Computing minimal associated primes in polynomial rings over the integers
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)
