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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: January 10, 2000; revised version: July 17, 2000
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s002000000043