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

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In Noro (2010) we proposed an algorithm for computing a primary ideal decomposition by using the notion of a separating ideal and showed that it can efficiently decompose several examples which are hard to decompose using existing algorithms. In particular, 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 this paper we define a more sophisticated class of separating ideals: saturated separating ideals. By using this notion we modify the algorithm of Noro (2010) such that it directly outputs a minimal primary decomposition without producing any intermediate redundant component.By modifying the process of extraction of a primary component via the pseudo-primary decomposition proposed in Shimoyama and Yokoyama (1996), we find a method for intermediate decomposition of an ideal and propose a variant of the new primary decomposition algorithm based on this intermediate decomposition. Our experiment shows that this variant efficiently decomposes many examples which are still hard to decompose even if we apply the original version of the new algorithm. Furthermore, in this algorithm we can bypass the computation of primary components and obtain directly the set of all associated primes of an ideal. © 2011 Elsevier Ltd.

Cite

CITATION STYLE

APA

Kawazoe, T., & Noro, M. (2011). Algorithms for computing a primary ideal decomposition without producing intermediate redundant components. Journal of Symbolic Computation, 46(10), 1158–1172. https://doi.org/10.1016/j.jsc.2011.06.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free