New Algorithms for Computing Primary Decomposition of Polynomial Ideals

DOI10.1007/978-3-642-15582-6_40zbMath1229.13003OpenAlexW1493103458MaRDI QIDQ5747887

Masayuki Noro

Publication date: 14 September 2010

Published in: Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15582-6_40

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Structure, classification theorems for modules and ideals in commutative rings (13C05)

Related Items (5)

Algorithms for computing a primary ideal decomposition without producing intermediate redundant components ⋮ Subexponential-time computation of isolated primary components of a polynomial ideal ⋮ An algorithm for computing Grothendieck local residues. I: Shape basis case ⋮ An algorithm for computing Grothendieck local residues. II: General case ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals

Uses Software

• Macaulay2
• Risa/Asir
• SINGULAR

This page was built for publication: New Algorithms for Computing Primary Decomposition of Polynomial Ideals