Difference between revisions of "ApCoCoA-1:CharP.GBasisModSquares"
KHiddemann (talk | contribs) (adding keys) |
(Added ApCoCoAServer note) |
||
| Line 6: | Line 6: | ||
</syntax> | </syntax> | ||
<description> | <description> | ||
| + | {{ApCoCoAServer}} | ||
| + | |||
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 | 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! | 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! | ||
Revision as of 14:00, 14 November 2008
Char2.GBasisModSquares
computing a gbasis of a given ideal, intersected with <formula>x^2-x</formula> for all indeterminates x
Syntax
$char2.GBasisModSquares(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 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.
See also
