Refined algorithms to compute syzygies

DOI10.1016/J.JSC.2015.07.004zbMATH Open1405.14138arXiv1502.01654OpenAlexW178584738MaRDI QIDQ898264FDOQ898264

Authors: Burçin Eröcal, Oleksandr Motsak, Frank-Olaf Schreyer, Andreas Steenpaß 

Publication date: 8 December 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: Based on Schreyer's algorithm (Schreyer, 1980, 1991; Berkesch and Schreyer, 2014), we present two refined algorithms for the computation of syzygies. The two main ideas of the first algorithm, called LiftHybrid, are the following: First, we may leave out certain terms of module elements during the computation which do not contribute to the result. These terms are called "lower order terms", see Definition 4.2. Second, we do not need to order the remaining terms of these module elements during the computation. This significantly reduces the number of monomial comparisons for the arithmetic operations. For the second algorithm, called LiftTree, we additionally cache some partial results and reuse them at the remaining steps.

Full work available at URL: https://arxiv.org/abs/1502.01654

Recommendations

• Computing syzygies in finite dimension using fast linear algebra
• Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm
• scientific article
• Computation of Pommaret bases using syzygies
• Modular Algorithms for Computing a Generating Set of the Syzygy Module

zbMATH Keywords

syzygiesSchreyer algorithm

Mathematics Subject Classification ID

Syzygies, resolutions, complexes and commutative rings (13D02) Computational homological algebra (13P20) Computational aspects in algebraic geometry (14Q99)

Cites Work

• A Singular Introduction to Commutative Algebra
• Title not available (Why is that?)
• Varieties of sums of power
• Eigenvectors of tensors and algorithms for Waring decomposition
• A standard basis approach to syzygies of canonical curves.
• Syzygies of torsion bundles and the geometry of the level \(\ell \) modular variety over \(\overline{\mathcal{M}}_{g}\)
• Strategies for computing minimal free resolutions

Cited In (11)

• Computing representation matrices for the action of Frobenius on cohomology groups
• Equations and syzygies of \(K3\) carpets and unions of scrolls
• On the Computation of Minimal Free Resolutions with Integer Coefficients
• Minimal free resolutions of lattice ideals of digraphs
• Singular Value Decomposition of Complexes
• Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology
• Massively parallel methods for free resolutions
• Quadratic Gorenstein rings and the Koszul property I
• Computing H-bases via minimal bases for syzygy modules
• A Version of Green’s Conjecture in Positive Characteristic
• Computing the Betti table of a monomial ideal: a reduction algorithm

Uses Software

• FFLAS-FFPACK
• Macaulay2
• SageMath
• SINGULAR
• KoszulDivisorOnPic14M8
• Schreyer.lib

This page was built for publication: Refined algorithms to compute syzygies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898264)