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

From ApCoCoAWiki
m (insert version info)
 
(6 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 +
{{Version|1}}
 
<command>
 
<command>
     <title>Char2.GBasisF512</title>
+
     <title>CharP.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
+
CharP.GBasisF512(Ideal:IDEAL):LIST
 
</syntax>
 
</syntax>
 
     <description>
 
     <description>
 
<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 28: Line 29:
 
-------------------------------
 
-------------------------------
 
I:=Ideal(x-y^2,x^2+xy,y^3);
 
I:=Ideal(x-y^2,x^2+xy,y^3);
Char2.GBasisF512(I);
+
CharP.GBasisF512(I);
 
-- WARNING: Coeffs are not in a field
 
-- WARNING: Coeffs are not in a field
 
-- GBasis-related computations could fail to terminate or be wrong
 
-- GBasis-related computations could fail to terminate or be wrong
Line 40: Line 41:
  
 
     <seealso>
 
     <seealso>
       <see>GBasis</see>
+
       <see>ApCoCoA-1:GBasis|GBasis</see>
     <see>Introduction to CoCoAServer</see>
+
     <see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see>
     <see>Introduction to Groebner Basis in CoCoA</see>
+
     <see>ApCoCoA-1:Introduction to Groebner Basis in CoCoA|Introduction to Groebner Basis in CoCoA</see>
     <see>Char2.GBasisF2</see>  
+
     <see>ApCoCoA-1:CharP.GBasisF2|CharP.GBasisF2</see>  
     <see>Char2.GBasisF4</see>
+
     <see>ApCoCoA-1:CharP.GBasisF4|CharP.GBasisF4</see>
     <see>Char2.GBasisF8</see>
+
     <see>ApCoCoA-1:CharP.GBasisF8|CharP.GBasisF8</see>
     <see>Char2.GBasisF16</see>
+
     <see>ApCoCoA-1:CharP.GBasisF16|CharP.GBasisF16</see>
     <see>Char2.GBasisF32</see>
+
     <see>ApCoCoA-1:CharP.GBasisF32|CharP.GBasisF32</see>
     <see>Char2.GBasisF64</see>
+
     <see>ApCoCoA-1:CharP.GBasisF64|CharP.GBasisF64</see>
     <see>Char2.GBasisF128</see>
+
     <see>ApCoCoA-1:CharP.GBasisF128|CharP.GBasisF128</see>
     <see>Char2.GBasisF256</see>
+
     <see>ApCoCoA-1:CharP.GBasisF256|CharP.GBasisF256</see>
     <see>Char2.GBasisF1024</see>
+
     <see>ApCoCoA-1:CharP.GBasisF1024|CharP.GBasisF1024</see>
     <see>Char2.GBasisF2048</see>
+
     <see>ApCoCoA-1:CharP.GBasisF2048|CharP.GBasisF2048</see>
     <see>Char2.GBasisF4096</see>
+
     <see>ApCoCoA-1:CharP.GBasisModSquares|CharP.GBasisModSquares</see>
    <see>Char2.GBasisModSquares</see>
+
     <see>ApCoCoA-1:Representation of finite fields|Representation of finite fields</see>
     <see>Representation of finite fields</see>
 
 
   </seealso>     
 
   </seealso>     
  
Line 65: Line 65:
  
 
     <key>GBasisF512</key>
 
     <key>GBasisF512</key>
     <key>char2.GBasisF512</key>
+
     <key>charP.GBasisF512</key>
 
     <key>finite field</key>
 
     <key>finite field</key>
     <wiki-category>Package_char2</wiki-category>
+
     <wiki-category>ApCoCoA-1:Package_charP</wiki-category>
 
   </command>
 
   </command>

Latest revision as of 09:55, 7 October 2020

This article is about a function from ApCoCoA-1.

CharP.GBasisF512

Computing a Groebner Basis of a given ideal in F_512.

Syntax

CharP.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);
CharP.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

CharP.GBasisF2

CharP.GBasisF4

CharP.GBasisF8

CharP.GBasisF16

CharP.GBasisF32

CharP.GBasisF64

CharP.GBasisF128

CharP.GBasisF256

CharP.GBasisF1024

CharP.GBasisF2048

CharP.GBasisModSquares

Representation of finite fields