Algorithms for computing a primary ideal decomposition without producing intermediate redundant components (Q719762): Difference between revisions

\textit{M.~Noro} [Lect. Notes Comput. Sci. 6327, 233--244 (2010; Zbl 1229.13003)], an algorithm was proposed for computing a primary ideal decomposition by using the notion of a separating ideal. It was shown that it can efficiently decompose several examples which are hard to decompose using other existing algorithms. The number of redundant components produced in the algorithm is zero or very small in many examples, but no theoretical explanation for the efficiency was given. In the paper under review the authors define a more sophisticated class of separating ideals. They call them \textit{saturated separating ideals}. Using them, the authors were able to modify the above mentioned algorithm so that it directly outputs a minimal primary decomposition without producing any intermediate redundant component (Algorithm 3). However, the costs for computing saturated separating ideals and isolated primary components are often very high. Because of that the authors propose a variant of Algorithm 3 based on an intermediate decomposition. In this variant each saturated separating ideal is computed for extracting only one unknown primary component and this makes both the computation of the saturated separating ideal and that of the primary component easy. In the section Discussion the authors analyze various aspects of the new algorithms, including the possibility of parallel computation.