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

From ApCoCoAWiki

KHiddemann (talk | contribs) m (add examples later) |
(added to category Package_Numerical) |
||

Line 15: | Line 15: | ||

<see>GBasis</see> | <see>GBasis</see> | ||

</seealso> | </seealso> | ||

+ | <wiki-category>Package_Numerical</wiki-category> | ||

</command> | </command> |

## Revision as of 12:00, 22 October 2007

## $char2.GBasisModSquares

computing a gbasis of a 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.

### See also