Skip to main content
Log in

A Koszul Decomposition for the Computation of Linear Syzygies

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: January 10, 2000; revised version: July 17, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Albano, G., La Scala, R. A Koszul Decomposition for the Computation of Linear Syzygies. AAECC 11, 181–202 (2001). https://doi.org/10.1007/s002000000043

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000000043

Navigation