SearcharxivSearch

arXiv subjects

V. P. Burichenko

Publications and source records attributed to V. P. Burichenko.

2 recordsLinked to original sources

The isotropy group of the matrix multiplication tensor

By an {\em isotropy group} of a tensor $t\in V_1 \otimes V_2\otimes V_3=\widetilde V$ we mean the group of all invertible linear transformations of $\widetilde V$ that leave $t$ invariant and are compatible (in an obvious sense) with the structure of tensor product on~$\widetilde V$. We consider the case where $t$ is the structure tensor of multiplication map of rectangular matrices. The isotropy group of this tensor was studied in 1970s by de Groote, Strassen, and Brockett-Dobkin. In the present work we enlarge, make more precise, expose in the language of group actions on tensor spaces, and endow with proofs the results previously known. This is necessary for studying the algorithms of fast matrix multiplication admitting symmetries. The latter seems to be a promising new way for constructing fast algorithms.

cs.CC

Symmetries of matrix multiplication algorithms. I

In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of Hopcroft, Laderman, and Pan. The automorphism group is isomorphic to $S_3\times Z_2$ and $S_4$ for Hopcroft anf Laderman algorithms, respectively. The studying of symmetry of algorithms may be a fruitful idea for finding fast algorithms, by an analogy with well-known optimization problems for codes, lattices, and graphs. {\em Keywords}: Strassen algorithm, symmetry, fast matrix multiplication.

cs.CC