ApCoCoA-1:CharP.GBasisF64

From ApCoCoAWiki
Revision as of 09:55, 7 October 2020 by AndraschkoBot (talk | contribs) (insert version info)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
This article is about a function from ApCoCoA-1.

CharP.GBasisF64

Computing a Groebner Basis of a given ideal in F_64.

Syntax

CharP.GBasisF64(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_64 = (Z/(2))[x]/(x^6 + x + 1).

  • @param Ideal An Ideal in a Ring over Z, where the elements 0,...,63 represent the elements of the field F_64. 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.GBasisF64(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 + 32x, x^2, xy]
-------------------------------


See also

GBasis

Introduction to Groebner Basis in CoCoA

CharP.GBasisF2

CharP.GBasisF4

CharP.GBasisF8

CharP.GBasisF16

CharP.GBasisF32

CharP.GBasisF128

CharP.GBasisF256

CharP.GBasisF512

CharP.GBasisF1024

CharP.GBasisF2048

CharP.GBasisModSquares

Representation of finite fields