Computing minimal finite free resolutions

From MaRDI portal
(Redirected from Publication:1358902)





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.





Describes a project that uses

Uses Software






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)