Difference between revisions of "ApCoCoA-1:CharP.GBasisF16"
From ApCoCoAWiki
(New page: <command> <title>Char2.GBasisF16</title> <short_description>computing a gbasis of a given ideal in <formula>\mathbb{F}_16</formula</short_description> <syntax> $char2.GBasisF16(I...) |
KHiddemann (talk | contribs) (fixing the XML tag) |
||
| Line 1: | Line 1: | ||
<command> | <command> | ||
<title>Char2.GBasisF16</title> | <title>Char2.GBasisF16</title> | ||
| − | <short_description>computing a gbasis of a given ideal in <formula>\mathbb{F} | + | <short_description>computing a gbasis of a given ideal in <formula>\mathbb{F}_{16}</formula></short_description> |
<syntax> | <syntax> | ||
$char2.GBasisF16(Ideal):List | $char2.GBasisF16(Ideal):List | ||
Revision as of 14:04, 3 February 2008
Char2.GBasisF16
computing a gbasis of a given ideal in <formula>\mathbb{F}_{16}</formula>
Syntax
$char2.GBasisF16(Ideal):List
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.
See also
