Hi!

In the program below, all solutions are found for the equation S.R=T subject to 

the constraints given by eq1 and eq2. I've tried it for a 

few different choices of T and there's usually 80+ solutions.

I want to try more complicated choices of T (for example,

I want the matrix T to have every entry a distinct prime number). 

But then the program crashes. I assume the equations get complicated

or there...

Hi!

I want to program a specific type of tensor product in to Maple. For two 2x2x2 tensors (hypermatrices)

(A|B) and (C|D), there is a product x defined by equation (2) in the link that yields a 2x2x2x2 tensor

(it would be too difficult to type the product here). If someone

could please let me know how to write a short algorithm that takes as input (A|B) and (C|D) 

and outputs the product (represent it however is most convienent). 

Hi! Any help would be greatly appreciated :)

I have two matrices S and R, where 

S :=

Matrix([[a_1, a_2, a_3, a_4], [b_1, b_2, b_3, b_4], [c_1, c_2, c_3, c_4], [d_1, d_2, d_3, d_4]]);

such that 

a_1*d_1 = b_1*c_1
a_2*d_2 = b_2*c_2
a_3*d_3 = b_3*c_3
a_4*d_4 = b_4*c_4;

and 

R :=

Matrix([[s_1, t_1, r_1, l_1], [s_2, t_2, r_2, l_2], [s_3, t_3, r_3, l_3], [s_4, t_4, r_4, l_4]]);

Hi! Any help would be greatly appreciated :)

I have two matrices S and R, where 

S := Matrix( [ [a_1, a_2, a_3, a_4], [b_1, b_2, b_3, b_4], [c_1, c_2, c_3, c_4], [d_1, d_2, d_3, d_4] ] );

such that 

a_1*d_1 = b_1*c_1
a_2*d_2 = b_2*c_2
a_3*d_3 = b_3*c_3
a_4*d_4 = b_4*c_4;

and 

R := Matrix( [ [s_1, t_1, r_1, l_1], [s_2, t_2, r_2, l_2], [s_3, t_3, r_3, l_3], [s_4, t_4, r_4, l_4] ] );

such that 

I am working over F_p, where p is prime. When p = 2, the number of 2x2x2 arrays (aka hypermatrices or tensors) over this field is 2^(2*2*2) = 256. Of those 256 arrays, I only want the symmetric ones: that is, if x_{ijk} is the ijk-th element of the array X, then x_{ijk} = x_{ikj} = x_{jik} = x_{jki} = x_{kij} = x_{kji}. Is there a quick loop that does this?