Hi, all,
Is there a command to test whether two polynomials are equal to each other?
Or I have to write a procedure to do that?
Thanks.
Gepo
Is there a way in Maple to compute a radical ideal?
For example, how to compute radical ideal of "a+b" with a,b in any field?
Thanks in advance.
Gepo
Hi, all,
I am wondering whether Maple have the capacity to compute boolean operations containing variables.
For example, I want to compute (a1*b0)xor(a0*b1), is there a way to do that. I know Maple has "Xor" command to compute the xor of two given numbers. Is there a way to do that over variables?
thanks a lot
Gepo
Now I am using a method that kept trying polynomial to check whether it is primitive. This method works fine for not very large Galois field. But for large one, like GF(2^1024) or GF(2^2048), it is pretty slow.
Is there a way to quickly find ONE primitive polynomial in GF(2^1024) or GF(2^2048)?
Just one, not too many.
Thanks
Gepo
Method I am using:
findprim := proc (n, deg)
F := NULL;
i := 0;
while i
i want to get compute the extended Euclidean of two polynomials and now I am using gcdex, but it takes too much time for big polynomial.
For example:
alias(a=RootOf(1+z^31+z^23+z^11+z^7+z^2+z^32));
gcdex(x^32,x^32+(a^15+a^11+a^6)*x^31+(a^13+a^10+a^3)*x^23+(a^11+a^7+a^2+1)*x^11+x^7+a^13+a^10+a^3+a^1+1,1,x's','t');
Is there a better way to do this?
Thanks
Gepo
Hi, all,
After some computation, I got a huge polynomial:
a00*x^123+a45*x^233+a02*x^123+a67*x^156+a47*x^67+.......(with more than 30,000 monomials).
This generated polynomial has some features:
1: the degree of each monomial is not more than 256.
2:each monomial only has ONE coefficient.
3:There are two or more monomials have the same degree, so they can be combined together. Such as a00*x^123+a02*x^123=(a00+a02)*x^123.
4:for any coefficient a[ij], i is from 0 though 15, j is also from 0 through 15.
Hi,all,
here is my question:
alias(alpha=RootOf(x^32+x^26+x^19+x^15+x^13+x^11+x^9+x^8+x^4+x+1));
and then i want to compute:
alpha^12345678987654321;
But when I did it in maple, it failed.
I think there should be some way to do it.
Would you like to help me?
Thanks
Gepo
Hi, all,
Is there a way to list some primitive polynomials for a given degree over galois field GF(2).
For example, I want to get some primitive polynomials of GF(2^32), is there a way to do that?
Thanks
Gepo
Hi, all,
Is there a way to extract all the variables in a list of polynomials?
For example:
L:=[2*a*b,x^2+y,d*y^2];
I want to get [a,b,x,y,d]. The order of variables does not matter.
Thanks
Gepo
February 25 2010
by
gepo 531
Hi, all,
I have known how to compute Groebner basis over galois field.
For example, the following example is to compute Groebner basis over GF(2^3):
alias(alpha=RootOf(Z^3+Z+1));
F := {alpha*x*y+alpha^2+1, alpha^2*x^2-1};
G := Groebner[Basis](F, plex(x,y), characteristic=2);
But now I have a doubt.
If I give one more "alias", is the Groebner basis still computed over GF(2^3)?
For example:
alias(alpha=RootOf(Z^3+Z+1));
alias(beta=RootOf(u^2+u+1));
F := {alpha*x*y+alpha^2+1, alpha^2*x^2-1,alpha^2*beta+x*y};
G := Groebner[Basis](F, plex(x,y), characteristic=2);
Hi, all,
Is there a way to compare two lists containing polynomials to check whether they are equal?
Thanks
Gepo
Hi, all,
I have a list of polynomials and then I want to get polynomials which include given variables. How can I do this?
For example, I have a list: L:=[a+b+c,x+ab+d^3,y+c];
and I am only interested in polynomials which include varaibles "a", "b", "c", which is "a+b+c".
Which command can implement this?
thanks
Gepo
Hi,
I have a set of equations and I want to express them into a list.
L:=[];
for i from 1 to 2 do
a[i]=b[i]+c[i];
L:=[op(L),'a[i]'=a[i]];
end do
the result is:
[a[i]=b[1]+c[1],a[i]=b[2]+c[2]];
But what I want is:
[a[1]=b[1]+c[1],a[2]=b[2]+c[2]];
Is there any way to implement it?
thanks
Gepo
Hi, all
When I read the contents read from a file, I found the order was different from that in file.
For example,
In file a.txt:
a+b+c;
d+f+g;
b+c+d;
d+e+g;
m+g+a;
a+m+f+1;
After reading, I stored them in a list:
L := [d+f+g, b+c+d, d+e+g, a+m+f+1, m+g+a, a+b+c];
The order is changed somehow.
The procedure I am using here is:
HandleGB :=proc(file)
local line, T,L,f,cnt;
f:=fopen(file,READ);
try
T:=table();
line:=readline(f);
T[cnt]:=parse(line);
for cnt do
line:=readline(f);
if line=0 then break; end if;
T[cnt]:=parse(line);
end do;
finally
Hi, all,
I want to know whether I get a row of a matrix.
For example, I have a matrix:
[ 1 0 0 1]
[ 0 1 0 1]
M=[ 1 0 1 0]
[ 0 0 0 1]
and I want to the first row [ 1 0 0 1],
how to do this?
thanks
Gepo
