Computing minimal finite free resolutions

DOI10.1016/S0022-4049(97)00007-8MaRDI QIDQ1358902zbMATH OpenFDO

Authors A. Capani, Gabriel de Dominicis, Gianfranco Niesi, Lorenzo Robbiano

Publication date 18 February 1999

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-4049(97)00007-8

zbMATH Keywords

Buchberger's algorithmGröbner basisPoincaré seriessyzygies

Mathematics Subject Classification ID

Syzygies, resolutions, complexes and commutative rings (13D02) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Review text

An algorithm to construct a minimal resolution for a graded submodule \(M\) of a free graded module over a polynomial ring is presented. Let \(m_1,\dots,m_d\) be a minimal basis of \(M\). The peculiarity of the proposed algorithm consists in the successive construction of the minimal basis for \(\text{Syz} (m_1, \dots, m_d)\) at every step in the process of running Buchberger's algorithm to obtain the Gröbner basis. Additional improvements, e.g., using the Poincaré series are indicated. Results of the computation for several examples are presented.

Recommendations

• Remarks on the computation of minimal finite free resolutions
• On the computation of minimal free resolutions with integer coefficients
• Strategies for computing minimal free resolutions
• Minimal free resolutions over complete intersections
• On computation of minimal free resolutions over solvable polynomial algebras.
• Finite free resolutions
• scientific article; zbMATH DE number 1302478
• On minimal graded free resolutions
• Linear free resolutions and minimal multiplicity
• scientific article; zbMATH DE number 1457514

Cites work

• Gröbner bases and primary decomposition in polynomial rings in one variable over Dedekind domains
• scientific article; zbMATH DE number 3889695 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• New constructive methods in classical ideal theory
• On an implementation of standard bases and syzygies in SINGULAR
• SINGULAR: A computer algebra system for singularity theory, algebraic geometry and commutative algebra

Cited in

(15)

• New constructive methods in classical ideal theory
• Strategies for computing minimal free resolutions
• Computation of minimal homogeneous generating sets and minimal standard bases for ideals of free algebras
• Finite group characters on free resolutions
• The Frobenius number and a-invariant
• On the computation of minimal free resolutions with integer coefficients
• On computation of minimal free resolutions over solvable polynomial algebras.
• scientific article; zbMATH DE number 1263424 (Why is no real title available?)
• scientific article; zbMATH DE number 1302478 (Why is no real title available?)
• On the free resolution induced by a Pommaret basis
• Computing minimal free resolutions of right modules over noncommutative algebras
• Remarks on the computation of minimal finite free resolutions
• Computing Gröbner bases and free resolutions of OI-modules
• Computing representation matrices for the action of Frobenius on cohomology groups
• Propagating weights of tori along free resolutions

Describes a project that uses

Uses Software

• SINGULAR
• CoCoA
• Macaulay2

This page was built for publication: Computing minimal finite free resolutions

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