Counting with tensor products – mathoverflow.net

Counting with tensor products – mathoverflow.net

16:03 No Comments
Suppose I've got vectors $v = (1,-1)$ and $w = (1,1)$ and any $m \in \mathbb{N}$. Let $a = v \otimes v \otimes w^{\otimes m}$ and let $\tilde{a}$ be the sum over all $\binom{m}{2}$ unique vectors ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Counting with tensor products – mathoverflow.net"

Post a Comment

Subscribe to: Post Comments (Atom)