Primary decompositions of three-generated ideals
β Scribed by Chun-Tak Fan
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 922 KB
- Volume
- 105
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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 componen
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
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