𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the Primary Decomposition of Zero-dimensional Ideals

✍ Scribed by Chris Monico

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
228 KB
Volume
34
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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. In practice, the algorithm generally works in finite fields of large characteristic as well.

📜 SIMILAR VOLUMES

Primary Decomposition of Lattice Basis I
Primary Decomposition of Lattice Basis Ideals
✍ Serkan Hoşten; Jay Shapiro 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We study the primary decomposition of lattice basis ideals. These ideals are binomial ideals with generators given by the elements of a basis of a saturated integer lattice. We show that the minimal primes of such an ideal are completely determined by the sign pattern of the basis elements, while th

Unmixed-dimensional Decomposition of a F
Unmixed-dimensional Decomposition of a Finitely Generated Perfect Differential Ideal
✍ Driss Bouziane; Abdelilah Kandri Rody; Hamid Maârouf 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We present an algorithm that computes an unmixed-dimensional decomposition of a finitely generated perfect differential ideal I. Each I i in the decomposition I = I 1 ∩ • • • ∩ I k is given by its characteristic set. This decomposition is a generalization of the differential case of Kalkbrener's dec

Computing the Radical of an Ideal in Pos
Computing the Radical of an Ideal in Positive Characteristic
✍ Ryutaroh Matsumoto 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We propose a method for computing the radical of an arbitrary ideal in the polynomial ring in n variables over a perfect field of characteristic p > 0. In our method Buchberger's algorithm is performed once in n variables and a Gröbner basis conversion algorithm is performed at most n log p d times