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

From ApCoCoAWiki
Line 1: Line 1:
 
<command>
 
<command>
 
     <title>Char2.GBasisF512</title>
 
     <title>Char2.GBasisF512</title>
     <short_description>Computing a Groebner Basis of a given ideal in F_512.</short_description>
+
     <short_description>Computing a Groebner Basis of a given ideal in <tt>F_512</tt>.</short_description>
 
<syntax>
 
<syntax>
 
Char2.GBasisF512(Ideal:IDEAL):LIST
 
Char2.GBasisF512(Ideal:IDEAL):LIST
Line 8: Line 8:
 
<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
 
<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
 
<par/>
 
<par/>
This command computes a Groebner basis in the field F_512 = (Z/(2))[x]/(x^9 + x +1).  
+
This command computes a Groebner basis in the field <tt>F_512 = (Z/(2))[x]/(x^9 + x +1)</tt>.  
  
 
<itemize>
 
<itemize>
<item>@param <em>Ideal</em> An Ideal in a Ring over Z, where the elements 0,...,511 represent the elements of the field. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g. 11 = 8 + 2 + 1 = 2^3 + 2^1 + 2^0. So the number 11 corresponds to the polynomial x^3 + x + 1.</item>
+
<item>@param <em>Ideal</em> An Ideal in a Ring over <tt>Z</tt>, where the elements <tt>0,...,511</tt> represent the elements of the field. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g. <tt>11 = 8 + 2 + 1 = 2^3 + 2^1 + 2^0</tt>. So the number <tt>11</tt> corresponds to the polynomial <tt>x^3 + x + 1</tt>.</item>
 
<item>@return A Groebner Basis of the given ideal.</item>
 
<item>@return A Groebner Basis of the given ideal.</item>
 
</itemize>
 
</itemize>
Line 53: Line 53:
 
     <see>Char2.GBasisF1024</see>
 
     <see>Char2.GBasisF1024</see>
 
     <see>Char2.GBasisF2048</see>
 
     <see>Char2.GBasisF2048</see>
    <see>Char2.GBasisF4096</see>
 
 
     <see>Char2.GBasisModSquares</see>
 
     <see>Char2.GBasisModSquares</see>
 
     <see>Representation of finite fields</see>
 
     <see>Representation of finite fields</see>

Revision as of 08:30, 14 July 2009

Char2.GBasisF512

Computing a Groebner Basis of a given ideal in F_512.

Syntax

Char2.GBasisF512(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 command computes a Groebner basis in the field F_512 = (Z/(2))[x]/(x^9 + x +1).

  • @param Ideal An Ideal in a Ring over Z, where the elements 0,...,511 represent the elements of the field. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g. 11 = 8 + 2 + 1 = 2^3 + 2^1 + 2^0. So the number 11 corresponds to the polynomial x^3 + x + 1.

  • @return A Groebner Basis of the given ideal.

Example

Use R::=QQ[x,y,z];
I:=Ideal(x-y^2,x^2+xy,y^3);
GBasis(I);

[x^2 + xy, -y^2 + x, -xy]
-------------------------------
Use Z::=ZZ[x,y,z];
-- WARNING: Coeffs are not in a field
-- GBasis-related computations could fail to terminate or be wrong

-------------------------------
I:=Ideal(x-y^2,x^2+xy,y^3);
Char2.GBasisF512(I);
-- WARNING: Coeffs are not in a field
-- GBasis-related computations could fail to terminate or be wrong
-- CoCoAServer: computing Cpu Time = 0
-------------------------------
[y^2 + 256x, x^2, xy]
-------------------------------


See also

GBasis

Introduction to CoCoAServer

Introduction to Groebner Basis in CoCoA

Char2.GBasisF2

Char2.GBasisF4

Char2.GBasisF8

Char2.GBasisF16

Char2.GBasisF32

Char2.GBasisF64

Char2.GBasisF128

Char2.GBasisF256

Char2.GBasisF1024

Char2.GBasisF2048

Char2.GBasisModSquares

Representation of finite fields