Buchberger: This is a top level implementation of the equivariant Buchberger algorithm.
Incremental: This strategy uses Macaulay2's built in Gröbner basis algorithm gb. A Gröbner basis is computed for each truncated ideal. If no new elements are discovered up to Inc-action are discovered between the n truncation and the 2n-1 truncation for some n larger than the width of the generators, then the result is returned.
Signature: This is an implementation of an equivariant variant of the Gao-Volny-Wang signature based Gröbner basis algorithm. Experimental!
|
|
|
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/EquivariantGB.m2:1299:0.