CABOARA , Massimo

In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Gröbner bases via Buchberger's Algorithm. In a nutshell, the idea is to extend the advantages of computing with homogeneous polynomials or vectors to the general case. When the input data are not homogeneous, we use...

We prove a theorem, which provides a formula for the computation of the Poincar\'e series of a monomial ideal in $k[X_1,\dots,X_n]$, via the computation of the Poincare' series of some monomial ideals in $k[X_1,\dots ,\widehat{X_i}, \dots,X_n]$. The complexity of our algorithm is optimal for Borel-normed ideals and an implementation in CoCoA...

No description