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

From ApCoCoAWiki
Line 20: Line 20:
 
     <seealso>
 
     <seealso>
 
       <see>FGLM</see>
 
       <see>FGLM</see>
 +
      <see>FGLM.FGLM</see>
 
       <see>GBasis</see>
 
       <see>GBasis</see>
 +
      <see>Representation of finite fields</see>
 
     </seealso>
 
     </seealso>
  

Revision as of 14:20, 23 April 2009

Char2.GBasisModSquares

Computing a Groebner Basis of a given ideal intersected with x^2-x for all indeterminates x.

Syntax

Char2.GBasisModSquares(Ideal:IDEAL):LIST

Description

Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.

This function returns the reduced Groebner basis for the given ideal intersected with the ideal generated 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 Groebner Basis much faster!

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

  • @param Ideal An Ideal.

  • @return The reduced Groebner Basis of the given ideal.

See also

FGLM

FGLM.FGLM

GBasis

Representation of finite fields