This package includes various methods for pruning chain complexes over polynomial and local rings. In particular, in the local or graded case the output is guaranteed to be a minimal free resolution.
Algorithms in this package are also implemented using C++ in e/mutablecomplex.hpp for speed.
|
|
|
|
Here we produce an intentionally nonminimal resolution:
|
Now we prune the resolution above to get a minimal resolution:
|
|
|
Only supports localization at prime ideals.
This documentation describes version 1.0 of PruneComplex, released January 14th, 2017.
If you have used this package in your research, please cite it as follows:
|
The object PruneComplex is a package, defined in PruneComplex.m2, with auxiliary files in PruneComplex/.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/PruneComplex/doc.m2:32:0.