View source for ApCoCoA-1:CharP.GBasisModSquares

  <command>
    <title>Char2.GBasisModSquares</title>
    <short_description>computing a gbasis of a given ideal, intersected with <formula>x^2-x</formula> for all indeterminates x</short_description>
<syntax>
$char2.GBasisModSquares(Ideal):List
</syntax>
    <description>
This function returns reduced Groebner basis for the ideal, intersected with the ideal, created by <formula>x^2-x</formula> for all indeterminates. If <formula>x^2-x</formula> for 
all indeterminates is in the ideal (e.g. the set of zeros is a subset of <formula>{0,1}^n</formula>) 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. 
    </description>
    <seealso>
      <see>FGLM</see>
      <see>GBasis</see>
    </seealso>
    <wiki-category>Package_char2</wiki-category>
  </command>