We prove a theorem, which provides a formula for the computation of the Poincaré series of a monomial ideal in k[X1,⋯, Xn], via the computation of the Poincaré series of some monomial ideals in k[X1,⋯, Xi,⋯, Xn]. The complexity of our algorithm is optimal for Borel-normed ideals and an implementation in CoCoA strongly confirms its efficiency. An easy extension computes the Poincaré series of graded modules over standard algebras.
On the computation of Hilbert-Poincare' Series
CABOARA, MASSIMO;
1991-01-01
Abstract
We prove a theorem, which provides a formula for the computation of the Poincaré series of a monomial ideal in k[X1,⋯, Xn], via the computation of the Poincaré series of some monomial ideals in k[X1,⋯, Xi,⋯, Xn]. The complexity of our algorithm is optimal for Borel-normed ideals and an implementation in CoCoA strongly confirms its efficiency. An easy extension computes the Poincaré series of graded modules over standard algebras.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
