Difference between revisions of "ApCoCoA-1:CharP.GBasisModSquares"

From ApCoCoAWiki
(fixing category and a link.)
m (CoCoA4.7:Char2.GBasisModSquares moved to ApCoCoA:Char2.GBasisModSquares: moving to ApCoCoA namespace)
(No difference)

Revision as of 12:09, 22 October 2007


computing a gbasis of a given ideal, intersected with x^2-x for all indeterminates x




This function returns reduced Groebner basis for the ideal, intersected with the ideal, created by x^2-x for all indeterminates. If x^2-x for

all indeterminates is in the ideal (e.g. the set of zeros is a subset of {0,1}^n) this method should produce the GBasis much faster!

Please be aware, that this is much more efficient if the term ordering is Lex, DegLex or DegRevLex. Otherwise, first a DegRevLex GBasis is computed and then transformed with the FGLM-algorithm.

See also