For computing free resolutions over a polynomial ring the usual approach consists in iterating the Buchburger's algorithm for each module in the resolution. In this paper, we propose one single algorithm which can be viewed as a generalization of Buchberger's to chain complexes. The algorithm is based on the use of syzygies, due to Mo¨ller, Mora and Traverso, as criteria for avoiding useless computation of S-polynomials. Some strategies for the pairs selection in complexes are studied and tested in some experiments.

An Algorithm for Complexes

LA SCALA, Roberto
1994-01-01

Abstract

For computing free resolutions over a polynomial ring the usual approach consists in iterating the Buchburger's algorithm for each module in the resolution. In this paper, we propose one single algorithm which can be viewed as a generalization of Buchberger's to chain complexes. The algorithm is based on the use of syzygies, due to Mo¨ller, Mora and Traverso, as criteria for avoiding useless computation of S-polynomials. Some strategies for the pairs selection in complexes are studied and tested in some experiments.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/6243
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact