Hi,all, I found a weird problem. When I use alias of RootOf in a procedure, it seem that it cannot work correctly. The code is as following: > restart; > cf := proc (n, ir) local P; alias(x = RootOf(ir)); P := evala(Expand(x^4)) mod 2; print(P); end; >cf(4,x^4+x+1); x^4 ---------------------> should be x+1 However, when I use it in seperate commands, it works fine. > restart; >alias(x = RootOf(x^4+x+1)); >P := evala(Expand(x^4)) mod 2; >print(P); x+1 I have no idea what is wrong here Thanks Gepo

Hi, all,

I want to implement F4 computing Groebner basis in maple. However, when I read the paper described the F4 algorithm, it is terribly difficult to understand that example and I am pretty much sure there are mistakes in that paper.

Do you guys have some advice or documents to let me really get through the F4 algorithm?

 

Many thanks.

gepo

Hi, guys, I want to compare the performance of procedures which are written by myself. But I have no idea how to get the runtime of a procedure. Thanks in advance.

Hi, all, I want to sort hundreds of variables which are read from a file. Basically, this is what I want to use: Basis(L,plex(V)); "L" is a variable of list which is read froma file. This part is done. "V" is a variable of list which is read from a file. Well, this part is not done yet. Because I have no idea how to do this. For example, in a file, there are some variables: a, b ,c,d,e,f,g and I can read them into a variable of list: V=[a,b,c,d,e,f,g]; But the problem here is you cannot use it as plex(V) in Groebner basis package. Any suggestions? Thanks in advance. Gepo

Hi, I am wandering whether are some functions to compute all irreducible polynomial and prmitive polynomial over Galois field. For example, I want to all the irreducible and prmitive polynomials of GF(2^5). are there such commands to perform that? thanks