Thanks, that works just like I wanted!

One more question though, suppose I have two distinct polynomials, that I want to be zeros simultaneously.

Apparently the "union" of both systems cannot be considered by just doing solve({eqns1,eqns2},[a,b])

Is there a clean way to do this?

Thanks!

Thanks, that works just like I wanted!

One more question though, suppose I have two distinct polynomials, that I want to be zeros simultaneously.

Apparently the "union" of both systems cannot be considered by just doing solve({eqns1,eqns2},[a,b])

Is there a clean way to do this?

Thanks!

Hello,

that seems to work, thanks!

Hello,

that seems to work, thanks!

@Markiyan Hirnyk  Oh I am sorry, I missed your last reply.

It works, thanks!  However, when I switch e1 and e2 in A, something goes wrong:

> restart; with(difforms); defform(a = scalar, b = scalar, c = scalar);
> A := 2*a*`&^`(e1, e2)+b*`&^`(e2, e3)+c*`&^`(e4, e3) = `&^`(e2, e1);
       2 a e1 &^ e2 + b e2 &^ e3 + c e4 &^ e3 = e2 &^ e1
> B := eval(A, [`&^`(e1, e2) = x, `&^`(e2, e3) = y, `&^`(e4, e3) = z]);
                  2 a x + b y + c z = e2 &^ e1
> C := selectremove(proc (c) options operator, arrow; is(c, scalar) end proc, indets(B))[2];
                  {e1, e2, x, y, z, e2 &^ e1}
> E := {seq(coeff(lhs(B), C[j]) = coeff(rhs(B), C[j]), j = 1 .. nops(C))};

> solve(E, selectremove(proc (c) options operator, arrow; is(c, scalar) end proc, indets(B))[1]);

He doesn't seem to know that e2&^e1 is the opposite of e1 &^e2, and use of defform does not help.

I am planning to consider many equations between trivectors in 6-dimensional space, so inevitably I will need Maple to know this.

Is this possible?

@Markiyan Hirnyk  Oh I am sorry, I missed your last reply.

It works, thanks!  However, when I switch e1 and e2 in A, something goes wrong:

> restart; with(difforms); defform(a = scalar, b = scalar, c = scalar);
> A := 2*a*`&^`(e1, e2)+b*`&^`(e2, e3)+c*`&^`(e4, e3) = `&^`(e2, e1);
       2 a e1 &^ e2 + b e2 &^ e3 + c e4 &^ e3 = e2 &^ e1
> B := eval(A, [`&^`(e1, e2) = x, `&^`(e2, e3) = y, `&^`(e4, e3) = z]);
                  2 a x + b y + c z = e2 &^ e1
> C := selectremove(proc (c) options operator, arrow; is(c, scalar) end proc, indets(B))[2];
                  {e1, e2, x, y, z, e2 &^ e1}
> E := {seq(coeff(lhs(B), C[j]) = coeff(rhs(B), C[j]), j = 1 .. nops(C))};

> solve(E, selectremove(proc (c) options operator, arrow; is(c, scalar) end proc, indets(B))[1]);

He doesn't seem to know that e2&^e1 is the opposite of e1 &^e2, and use of defform does not help.

I am planning to consider many equations between trivectors in 6-dimensional space, so inevitably I will need Maple to know this.

Is this possible?

Many thanks.

Could one also do this for more than one variable?

I tried solve(identity(A,{x,y}),[a,b]) but that didn't work.

Many thanks.

Could one also do this for more than one variable?

I tried solve(identity(A,{x,y}),[a,b]) but that didn't work.

Thanks,

I tried

 restart; with(difforms);
defform(e1 = 1, e2 = 1);
`&^`(e1, e3)+`&^`(e3, e1)+`&^`(e1, e1);

And I get e1&^e3+ e3&^e1 as output, in other words, he knows he can cancel e1&^e1, but not that there is antisymmetry?

Kind regards.

Thanks,

I tried

 restart; with(difforms);
defform(e1 = 1, e2 = 1);
`&^`(e1, e3)+`&^`(e3, e1)+`&^`(e1, e1);

And I get e1&^e3+ e3&^e1 as output, in other words, he knows he can cancel e1&^e1, but not that there is antisymmetry?

Kind regards.

Hello,

I re-installed Maple and restarted my Macbook Pro, I still have the exact same problem. Then I tried the same code on Windows and there was no problem at all....

This is very strange, since I have done such things (often much harder with big matrices with more variables) in Maple 15 on the same Macbook Pro in the past??

Hello,

I'm afraidI am still using Maple 11.  Joe Riel's code does not work for me.  Both the code to create bin as the code to write to that file does not work for me.

Essentially, what I wanna do is convert a list like this

a[12]:=[12,156,23,211];
a[16]:=[143,12,145,216];

into stuff like

v[12]:=[   [1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1]];

v[16]:=[   [1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,1,0,1,1,1,1,1]];

Another program will then further process that data.  It accepts code in the exact form I gave it here (so with v[12]:= .... )

Is that feasible?

Many thanks!

Hello,

I'm afraidI am still using Maple 11.  Joe Riel's code does not work for me.  Both the code to create bin as the code to write to that file does not work for me.

Essentially, what I wanna do is convert a list like this

a[12]:=[12,156,23,211];
a[16]:=[143,12,145,216];

into stuff like

v[12]:=[   [1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1]];

v[16]:=[   [1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,0,0,1,1,1,1,1],[1,0,0,1,0,1,1,1,1,1]];

Another program will then further process that data.  It accepts code in the exact form I gave it here (so with v[12]:= .... )

Is that feasible?

Many thanks!