In the present paper some algorithms are proposed for computing Linear Strands and Betti Numbers of graded modules over polynomial rings. These algorithms are based on a block-decomposition, induced by the Koszul syzygies, of the linear systems involved with the Hilbert’s method for computing syzygies. Some further optimizations are suggested and applied by the authors to an implementation they have developed of the algorithms.
Koszul syzygies and sparse matrices for the computation of the Linear Strands
ALBANO, Giovannina;
2002-01-01
Abstract
In the present paper some algorithms are proposed for computing Linear Strands and Betti Numbers of graded modules over polynomial rings. These algorithms are based on a block-decomposition, induced by the Koszul syzygies, of the linear systems involved with the Hilbert’s method for computing syzygies. Some further optimizations are suggested and applied by the authors to an implementation they have developed of the algorithms.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.
