ApCoCoA-1:CharP.GBasisModSquares

From ApCoCoAWiki
Revision as of 09:25, 9 October 2007 by Dheldt (talk | contribs) (New page: <command> <title>$char2.GBasisModSquares</title> <short_description>computing a gbasis of an given ideal, intersected with x^2-x for all indeterminates x</short_description> <syn...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

$char2.GBasisModSquares

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

Syntax

$char2.GBasisModSquares(Ideal):List

Description

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.

Example

See also

FGLM

GBasis