𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Localization and Primary Decomposition of Polynomial Ideals

✍ Scribed by Takeshi Shimoyama; Kazuhiro Yokoyama

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
828 KB
Volume
22
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we propose a new method for primary decomposition of a polynomial ideal, not necessarily zero-dimensional, and report on a detailed study for its practical implementation. In our method, we introduce two key techniques, effective localization and fast elimination of redundant components, by which we can get a good performance for several examples. The performance of our method is examined by comparison with other existing methods based on practical experiments.

πŸ“œ SIMILAR VOLUMES

Toric Degenerations of Polynomial Ideals
Toric Degenerations of Polynomial Ideals and Geometric Localization of Fans
✍ STΓ‰PHANE COLLART; DANIEL MALL πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 580 KB

Toric degenerations of polynomial ideals occur if one allows certain partial term orders in the theory of GrΓΆbner bases. We prove that the collection of toric degenerations of an ideal can be monotonically embedded into the complex closure of the GrΓΆbner fan. A process of geometric localization on t

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

Computing the Primary Decomposition of Z
Computing the Primary Decomposition of Zero-dimensional Ideals
✍ Chris Monico πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 228 KB

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