CoCoA is a special-purpose system for doing Computations in Commutative Algebra. It runs on all common platforms.CoCoA's particular strengths include ideal/module operations (such as Gröbner bases,… (More)

The easiest geometric object in affine or projective space is a single rational point. It has no secrets, in particular its defining ideal, i.e. the set of all the polynomials which vanish at the… (More)

In this paper redescribe some experimentti findings on selection strategies for Gr6bner basis computation with the Buchberger algorithm. In particular, the results suggest that the “sugar flavor” of… (More)

In the computation of a Gröbner basis using Buchberger’s algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A… (More)

In this paper we continue the work done in [GMRT]. Namely we describean algorithm which allows to drive the classicalBuchberger Algorithm by meansof multigrade Hilbert-Poincar6 series. The resuIt is… (More)

A set of s points in f4 is called a Cayley-Bacharach scheme (CBscheme), if every subset of s 1 points has the same Hubert function. We investigate the consequences of this "weak uniformity." The main… (More)