Computation of the Minimal Associated Primes

Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation of the radical by Krick and Logar ([2]) (based on ideas by Gianni, Trager and Zacharias ([3])), that made it more efficient. In this work, we show how these same modifications can be applied to the algorithm for the computation of the minimal associated primes proposed in [3]. We explain the algorithm, our modifications and show some benchmarks that confirm that the new algorithm is more efficient than the original one. Keywords. Minimal associated primes, polynomial ideal, Gr

• Type: Conference
• Year: 2006
• Where: DAGSTUHL
• Authors: Santiago Laplagne
• Keywords: Algorithm, Computation, DAGSTUHL 2006, DAGSTUHL 2007, Minimal Associated Primes