witribm

10 Reputation

One Badge

3 years, 288 days

MaplePrimes Activity


These are questions asked by witribm

Hi, I have this procedure (from Maple 5) but I am using it in Maple 15. My problem is this program can not run. I think there is some commond incorrect, but not sure which ones. Please help me in this problem. Thanks a lot.

cocycle.mw

NULL

Cocycle := proc (L, n) local i, j, k, h, v, u, w, C, eqns, e, f, g; v := vector(n); eqns := {}; u := vector(n); w := vector(n); C := array(antisymmetric, 1 .. n, 1 .. n, []); for i to n do for j from i+1 to n do for k from j+1 to n do for h to n do v[h] := L[i, j, h]; u[h] := L[j, k, h]; w[h] := L[k, i, h] end do; e := array(sparse, 1 .. n, [k = 1]); f := array(sparse, 1 .. n, [i = 1]); g := array(sparse, 1 .. n, [j = 1]); eqns := `union`(eqns, multiply(transpose(e), multiply(C, v)))+multiply(transpose(f), multiply(C, u))+multiply(transpose(g), multiply(C, w)) end do end do end do; print('The*cocycles*are', eqns) end proc

proc (L, n) local i, j, k, h, v, u, w, C, eqns, e, f, g; v := vector(n); eqns := {}; u := vector(n); w := vector(n); C := array(antisymmetric, 1 .. n, 1 .. n, []); for i to n do for j from i+1 to n do for k from j+1 to n do for h to n do v[h] := L[i, j, h]; u[h] := L[j, k, h]; w[h] := L[k, i, h] end do; e := array(sparse, 1 .. n, [k = 1]); f := array(sparse, 1 .. n, [i = 1]); g := array(sparse, 1 .. n, [j = 1]); eqns := `union`(eqns, multiply(transpose(e), multiply(C, v)))+multiply(transpose(f), multiply(C, u))+multiply(transpose(g), multiply(C, w)) end do end do end do; print('The*cocycles*are', eqns) end proc

(1)

NULL

NULL


Download cocycle.m

Hi all,

I have this system

> system1D := H = alpha*gamma[2, 2]*d[2, 1]-beta*d[1, 2]*gamma[1, 2]^2-gamma*d[1, 2]*gamma[2, 1]^2+alpha*gamma[2, 2]^2*d[2, 2]-beta*d[2, 2]*gamma[2, 2]^2-gamma*d[2, 2]*gamma[2, 2]^2, E = alpha*gamma[2, 1]*d[1, 1]-beta*d[1, 2]*gamma[1, 1]-gamma*d[1, 1]*gamma[2, 1]+alpha*gamma[2, 1]^2*d[1, 2]-beta*d[2, 2]*gamma[2, 1]-gamma*d[2, 1]*gamma[2, 2], B = alpha*gamma[1, 1]*d[2, 1]-beta*d[1, 1]*gamma[1, 1]^2-gamma*d[1, 1]*gamma[1, 1]^2+alpha*gamma[1, 1]^2*d[2, 2]-beta*d[2, 1]*gamma[2, 1]^2-gamma*d[2, 1]*gamma[1, 2]^2, D = alpha*gamma[1, 2]*d[2, 1]-beta*d[1, 1]*gamma[1, 2]^2-gamma*d[1, 2]*gamma[1, 1]^2+alpha*gamma[1, 2]^2*d[2, 2]-beta*d[2, 1]*gamma[2, 2]^2-gamma*d[2, 2]*gamma[1, 2]^2, A = alpha*gamma[1, 1]*d[1, 1]-beta*d[1, 1]*gamma[1, 1]-gamma*d[1, 1]*gamma[1, 1]+alpha*gamma[1, 1]^2*d[1, 2]-beta*d[2, 1]*gamma[2, 1]-gamma*d[2, 1]*gamma[1, 2], C = alpha*gamma[1, 2]*d[1, 1]-beta*d[1, 1]*gamma[1, 2]-gamma*d[1, 2]*gamma[1, 1]+alpha*gamma[1, 2]^2*d[1, 2]-beta*d[2, 1]*gamma[2, 2]-gamma*d[2, 2]*gamma[1, 2], F = alpha*gamma[2, 1]*d[2, 1]-beta*d[1, 2]*gamma[1, 1]^2-gamma*d[1, 1]*gamma[2, 1]^2+alpha*gamma[2, 1]^2*d[2, 2]-beta*d[2, 2]*gamma[2, 1]^2-gamma*d[2, 1]*gamma[2, 2]^2, G = alpha*gamma[2, 2]*d[1, 1]-beta*d[1, 2]*gamma[1, 2]-gamma*d[1, 2]*gamma[2, 1]+alpha*gamma[2, 2]^2*d[1, 2]-beta*d[2, 2]*gamma[2, 2]-gamma*d[2, 2]*gamma[2, 2], H = alpha*delta[2, 2]*d[2, 1]-beta*d[1, 2]*delta[1, 2]^2-gamma*d[1, 2]*delta[2, 1]^2+alpha*delta[2, 2]^2*d[2, 2]-beta*d[2, 2]*delta[2, 2]^2-gamma*d[2, 2]*delta[2, 2]^2, E = alpha*delta[2, 1]*d[1, 1]-beta*d[1, 2]*delta[1, 1]-gamma*d[1, 1]*delta[2, 1]+alpha*delta[2, 1]^2*d[1, 2]-beta*d[2, 2]*delta[2, 1]-gamma*d[2, 1]*delta[2, 2], B = alpha*delta[1, 1]*d[2, 1]-beta*d[1, 1]*delta[1, 1]^2-gamma*d[1, 1]*delta[1, 1]^2+alpha*delta[1, 1]^2*d[2, 2]-beta*d[2, 1]*delta[2, 1]^2-gamma*d[2, 1]*delta[1, 2]^2, D = alpha*delta[1, 2]*d[2, 1]-beta*d[1, 1]*delta[1, 2]^2-gamma*d[1, 2]*delta[1, 1]^2+alpha*delta[1, 2]^2*d[2, 2]-beta*d[2, 1]*delta[2, 2]^2-gamma*d[2, 2]*delta[1, 2]^2, A = alpha*delta[1, 1]*d[1, 1]-beta*d[1, 1]*delta[1, 1]-gamma*d[1, 1]*delta[1, 1]+alpha*delta[1, 1]^2*d[1, 2]-beta*d[2, 1]*delta[2, 1]-gamma*d[2, 1]*delta[1, 2], C = alpha*delta[1, 2]*d[1, 1]-beta*d[1, 1]*delta[1, 2]-gamma*d[1, 2]*delta[1, 1]+alpha*delta[1, 2]^2*d[1, 2]-beta*d[2, 1]*delta[2, 2]-gamma*d[2, 2]*delta[1, 2], F = alpha*delta[2, 1]*d[2, 1]-beta*d[1, 2]*delta[1, 1]^2-gamma*d[1, 1]*delta[2, 1]^2+alpha*delta[2, 1]^2*d[2, 2]-beta*d[2, 2]*delta[2, 1]^2-gamma*d[2, 1]*delta[2, 2]^2, G = alpha*delta[2, 2]*d[1, 1]-beta*d[1, 2]*delta[1, 2]-gamma*d[1, 2]*delta[2, 1]+alpha*delta[2, 2]^2*d[1, 2]-beta*d[2, 2]*delta[2, 2]-gamma*d[2, 2]*delta[2, 2];


> subs({A = 0, B = 0, C = 0, D = 0, E = 0, F = 0, G = 0, H = 0, delta[1, 1] = 1, delta[1, 2] = 0, delta[2, 1] = 0, delta[2, 2] = 0, gamma[1, 1] = 1, gamma[1, 2] = 0, gamma[2, 1] = 0, gamma[2, 2] = 0, delta[1, 1]^2 = 0, delta[1, 2]^2 = 0, delta[2, 1]^2 = 1, delta[2, 2]^2 = 0, gamma[1, 1]^2 = 0, gamma[1, 2]^2 = 1, gamma[2, 1]^2 = 0, gamma[2, 2]^2 = 0}, {system1D});

The problem is: there is any simple way to use command "subs" when some expression such that delta[1,1]=1, gamma[1,1]=1, gamma[1,2]^2=1 have value and others are zero.

Can someone please advice and help me on this?

thanks

witribm

Hi all,

I have this system

> system2hD := 0 = -d[1, 2], 0 = -d[2, 1], 0 = -delta*d[1, 2], 0 = -d[1, 1]-delta*d[1, 1], 0 = -delta*d[1, 1]-d[2, 2];
> solve({system2hD, delta <> 0, delta <> 1}, {d[1, 1], d[1, 2], d[2, 1], d[2, 2]});
      {d[1, 1] = 0, d[1, 2] = 0, d[2, 1] = 0, d[2, 2] = 0}

But, I hope to get the answers as {d[1, 1] = -delta*d[1, 1], d[1, 2] = 0, d[2, 1] = 0, d[2, 2] = -delta*d[1, 1]}. I think, I should not use the command "solve".

Can someone please advice and hepl me on this?

thanks

witribm

Hi,

why the output for this program just only "print BChange" not a matrix?

 

Der:=proc(A,n)

local i,j,k,t,S1,S2,l,C,sols,eqns,BChange;

C:=matrix(n,n); BChange:=matrix(n,n); eqns:={};

for i to n-1 do

  for j from i+1 to n do

    for l to n do

      S1:=sum(A[i,j,k]*C[k,l],k=1..n);

      S2:=sum(A[k,j,l]*C[i,k]+A[i,k,l]*C[j,k],k=1..n);

      eqns:=union(eqns,{S1=S2})

    end do

  end do

end do;

 

sols:=[solve(eqns)];

t:=nops(sols);

for i to t do

  for j to n do

    for k to n do

      BChange[j,k]:=subs(sols[i],C[j,k])

    end do;

  end do;

end do;

print (BChange)

end proc:

 

> A1 := array(sparse, 1 .. 2, 1 .. 2, 1 .. 2, [(1, 1, 2) = 1]):
> Der(A1, 2);
                                                                   print BChange

 

Can someone please advice me on this?

thanks

witribm

 

Can i make a system of equations like this in maple?

 

What i am trying to do is i want to get all system of equations. For example when n=2, then we should get 8 equations like D(1,1,1), D(1,1,2),D(1,2,1),D(1,2,2),D(2,1,1),D(2,1,2),D(2,2,1) and D(2,2,2). If n=3 then the number of equations is 27 and so on. Can someone please advice me on this?

thanks

witribm

Page 1 of 1