An algorithm for primary decomposition in polynomial rings over the integers

DOI10.2478/S11533-011-0037-8zbMATH Open1246.13028arXiv1008.2074OpenAlexW2080384246MaRDI QIDQ657376FDOQ657376

Afshan Sadiq, Gerhard Pfister, Stefan Steidel

Publication date: 16 January 2012

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1008.2074

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

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]parallel computationprimary decompositionmodular computation

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Computational aspects and applications of commutative rings (13P99)

Cites Work

• SINGULAR
• Direct methods for primary decomposition
• Title not available (Why is that?)
• Gröbner bases and primary decomposition of polynomial ideals
• Binomial ideals
• Localization and primary decomposition of polynomial ideals
• Constructions in a Polynomial Ring Over the Ring of Integers
• Title not available (Why is that?)
• The Gröbner basis of the ideal of vanishing polynomials
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• The decomposition theorem for ideals in polynomial rings over a domain

Cited In (8)

• An algorithm for polynomial multiplication that does not depend on the ring constants
• Implementation of prime decomposition of polynomial ideals over small finite fields
• Efficient algorithms for finite \(\mathbb{Z}\)-algebras
• An algorithm to compute a primary decomposition of modules in polynomial rings over the integers
• Computing minimal associated primes in polynomial rings over the integers
• Primary decomposition of squarefree pseudomonomial ideals
• Prime decompositions of radicals in polynomial rings
• Decomposing finite \(\mathbb{Z}\)-algebras

Uses Software

• SINGULAR
• SymbolicData
• primdecint.lib

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)