Computing the primary decomposition of zero-dimensional ideals

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

Let K be an infinite perfect computable field and let I ⊆ K[x] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. ln practice, the algorithm generally works in finite fields of large characteristic as well.

Original languageEnglish
Pages (from-to)451-459
Number of pages9
JournalJournal of Symbolic Computation
Volume34
Issue number5
DOIs
StatePublished - Nov 1 2002

Fingerprint Dive into the research topics of 'Computing the primary decomposition of zero-dimensional ideals'. Together they form a unique fingerprint.

  • Cite this