The length of a complex is the difference between the highest index of a non-zero object and the lowest index of a non-zero object.
Typically, it counts the number of non-zero differentials, e.g. in a free resolution.
|
|
|
|
|
|
|
This function always prunes the input complex, so might involve computation.
|
|
|
|
|
|
|
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/Complexes/ChainComplexDoc.m2:2312:0.