Jtdylktuy

0 $begingroup$ I tried to think about some characteristics of the trees, for example, they have a number of edges equal to $|text{Vertices}|-1$ and of course the handshaking lemma but I couldn't find properly logical reasoning. Any help? discrete-mathematics graph-theory trees share | cite | improve this question edited Dec 24 '18 at 18:01 EdOverflow 251 1 9 asked Dec 24 '18 at 17:44 PCNF PCNF 133 8 ...

0 $begingroup$ I'm trying to create a 3-rank tensor in numpy, with python3.x. I need to create this 3-rank tensor A in a very particular way. If I have 3 matrices, let's say that all of them are some $Y$ matrix (which is dimensionally $4x4$ ), then it must be of the following mathematical form: $A((in),(jk),(lm))$ from some type of multiplication roughly like: $"Y_{4}(i,j) otimes Y_{4}(k,l) otimes Y_{4}(m,n)"$ . So, in a sense, I must connect the "input" of a matrix to the "output" of another identical matrix, for three identical matrices. The final 3-rank tensor $A$ should have dimensions 16x16x16. Mathematically, I'm not sure if this corresponds to a tensor product or a kronecker product. Obviously this makes a big difference, as in numpy for python, the funct...

This page is only for reference, If you need detailed information, please check here