Macaulay2 » Documentation
Packages » ChainComplexExtras :: taylorResolution(...,LengthLimit=>...)
next | previous | forward | backward | up | index | toc

# taylorResolution(...,LengthLimit=>...) -- How many steps to compute

- Usage:
    `m = taylorResolution(C,LengthLimit => n)`
- Inputs:
  - C, a chain complex,
  - n, an integer, non-negative integer or infinity
- Outputs:
  - m, a chain complex,

## Description

Computes LengthLimit steps

## Functions with optional argument named LengthLimit:

- cartanEilenbergResolution(...,LengthLimit=>...) -- How many steps to compute
- isExact(ChainComplex,LengthLimit=>...) -- Option to check exactness only up to a particular homological degree
- isQuasiIsomorphism(...,LengthLimit=>...) -- Option to check quasi-isomorphism only up to a certain point
- koszulComplex(...,LengthLimit=>...) -- How many steps to compute
- `minimalBetti(...,LengthLimit=>...)` -- see minimalBetti -- minimal betti numbers of (the minimal free resolution of) a homogeneous ideal or module
- resolution(...,LengthLimit=>...) -- stop when the resolution reaches this length
- resolutionOfChainComplex(...,LengthLimit=>...) -- How many steps to compute
- taylorResolution(...,LengthLimit=>...) -- How many steps to compute

## Further information

- Default value: 0
- Function: taylorResolution -- Gives the Taylor resolution of a monomial ideal I.
- Option key: LengthLimit -- an optional argument

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/ChainComplexExtras.m2:1317:0.