Strategies for computing minimal free resolutions
From MaRDI portal
Recommendations
Cited in
(22)- Computing representation matrices for the action of Frobenius on cohomology groups
- Refined algorithms to compute syzygies
- Effective algorithms for parametrizing linear control systems over Ore algebras
- Average behavior of minimal free resolutions of monomial ideals
- A study of a family of monomial ideals
- Minimal resolutions of lattice ideals and integer linear programming
- Relative Gröbner and involutive bases for ideals in quotient rings
- The short resolution of a lattice ideal
- On the free resolution induced by a Pommaret basis
- scientific article; zbMATH DE number 1751826 (Why is no real title available?)
- Remarks on the computation of minimal finite free resolutions
- Propagating weights of tori along free resolutions
- Resolving algebras with straightening law
- Algorithms for \(D\)-modules -- restriction, tensor product, localization, and local cohomology groups
- Computing minimal finite free resolutions
- Modular Algorithms for Computing a Generating Set of the Syzygy Module
- Computing minimal presentations and bigraded Betti numbers of 2-parameter persistent homology
- An algorithm for de Rham cohomology groups of the complement of an affine variety via D-module computation
- Computing minimal free resolutions of right modules over noncommutative algebras
- Minimal free resolutions of homogenized \(D\)-modules
- ExteriorModules: a package for computing monomial modules over an exterior algebra
- On the computation of minimal free resolutions with integer coefficients
This page was built for publication: Strategies for computing minimal free resolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269746)
