Algorithms for computing a primary ideal decomposition without producing intermediate redundant components

DOI10.1016/j.jsc.2011.06.001zbMath1229.13026OpenAlexW2121361091MaRDI QIDQ719762

Masayuki Noro, Taro Kawazoe

Publication date: 11 October 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.06.001

zbMATH Keywords

Gröbner basis computationideal quotientprimary ideal decomposition

Mathematics Subject Classification ID

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 (6)

Algorithm for primary submodule decomposition without producing intermediate redundant components ⋮ Algorithms for computing a primary ideal decomposition without producing intermediate redundant components ⋮ primdecSYCI.lib ⋮ syci.m2 ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals ⋮ Efficient localization at a prime ideal without producing unnecessary primary components

Uses Software

• Macaulay2
• Risa/Asir
• SINGULAR
• OpenXM
• noro_pd

Cites Work

• Localization and primary decomposition of polynomial ideals
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
• Gröbner bases and primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Binomial ideals
• New Algorithms for Computing Primary Decomposition of Polynomial Ideals
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for computing a primary ideal decomposition without producing intermediate redundant components