EndDegree -- Option to specify the last homological degree processed by an iterative DG construction

Bounds how far an iterative DG algebra computation should proceed. In acyclicClosure this limits the homological degree of new generators adjoined; in isAcyclic it is the highest degree in which homology is checked; in toComplexMap it governs how many homological degrees of the resulting chain map are computed.

The default value varies by function and is documented on each specific bracketed option node. This option is required whenever a DG algebra has generators in even homological degree, since the algebra is otherwise unbounded.

Functions with optional argument named EndDegree:

• acyclicClosure(...,EndDegree=>...) -- Option to specify the degree to stop computing the acyclic closure
• isAcyclic(...,EndDegree=>...) -- Option to specify the degree to finish checking acyclicity
• killCycles(...,EndDegree=>...) -- Last homological degree processed by killCycles
• liftToDGMap(...,EndDegree=>...) -- see liftToDGMap -- Lift a ring homomorphism in degree zero to a DG algebra morphism
• liftToDGModuleMap(...,EndDegree=>...) -- see liftToDGModuleMap -- Lift an image of hom-degree-0 generators to a full DGModuleMap
• minimalModel(...,EndDegree=>...) -- see minimalModel -- Build the minimal DG algebra resolution of a quotient ring
• minimalSemifreeResolution(...,EndDegree=>...) -- Option to specify the last degree at which minimalSemifreeResolution kills cycles
• semifreeResolution(...,EndDegree=>...) -- Option to specify the last degree at which semifreeResolution kills cycles
• toComplexMap(...,EndDegree=>...) -- see toComplexMap -- Construct the ComplexMap associated to a DGAlgebraMap