𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing Ideals of Points

✍ Scribed by J. Abbott; A. Bigatti; M. Kreuzer; L. Robbiano

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
337 KB
Volume
30
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We address the problem of computing ideals of polynomials which vanish at a finite set of points. In particular we develop a modular Buchberger-MΓΆller algorithm, best suited for the computation over Q, and study its complexity; then we describe a variant for the computation of ideals of projective points, which uses a direct approach and a new stopping criterion. The described algorithms are implemented in CoCoA, and we report some experimental timings.

πŸ“œ SIMILAR VOLUMES

Computing Toric Ideals
Computing Toric Ideals
✍ A.M. Bigatti; R. La Scala; L. Robbiano πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 478 KB

Toric ideals are binomial ideals which represent the algebraic relations of sets of power products. They appear in many problems arising from different branches of mathematics. In this paper, we develop new theories which allow us to devise a parallel algorithm and an efficient elimination algorithm

Smooth Points and M-Ideals
Smooth Points and M-Ideals
✍ R. Grzaslewicz; R. Younis πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 174 KB
On the Resolution of Ideals of Fat Point
On the Resolution of Ideals of Fat Points
✍ G. Fatabbi πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 131 KB

In this paper we determine the Hilbert function and the minimal system of generators of r + 1 ≀ n + 1 general fat points of n . Furthermore, by looking at the minimal system of generators we can show that the ideal associated to two fat points in n or the ideal associated to r + 1 ≀ n general fat po

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

Using Galois Ideals for Computing Relati
Using Galois Ideals for Computing Relative Resolvents
✍ Philippe Aubry; Annick Valibouze πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 340 KB

In this paper we show that some ideals which occur in Galois theory are generated by triangular sets of polynomials. This geometric property seems important for the development of symbolic methods in Galois theory. It may and should be exploited in order to obtain more efficient algorithms, and it e