B = killHomologyAtDegree(A, n)Unlike killCycles, which searches for the first nontrivial degree upward from StartDegree, this method targets a specific degree. It computes the minimal generators of H_n(A) using the pruning map of prune homology(n, A), lifts them to cycles in A_n, and adjoins via adjoinVariables.
|
|
|
Over a regular ring, H_1 vanishes already, so the method short-circuits. Over a complete intersection, it adjoins new generators:
|
|
|
|
|
The object killHomologyAtDegree is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/DGAlgebras/doc.m2:6716:0.