4 papers
cs.CC2022
On automorphism group of a possible short algorithm for multiplication of matrices
Vladimir Burichenko
Studying algorithms admitting nontrivial symmetries is a prospective way of constructing new short algorithms of matrix multiplication. The main result of the article is that if th…
cs.CC2022
Non-existence of a short algorithm for multiplication of matrices with group , II
Vladimir P. Burichenko
It is proved that there is no an algorithm for multiplication of matrices of multiplicative length that is invariant under a certain group isomorphic to $S_4\ti…
cs.CC2022
Non-existence of a short algorithm for multiplication of matrices with group
Vladimir P. Burichenko
One of prospective ways to find new fast algorithms of matrix multiplication is to study algorithms admitting nontrivial symmetries. In the work possible algorithms for multiplicat…
cs.CC2022
The isotropy group of the matrix multiplication tensor
V. P. Burichenko
By an {\em isotropy group} of a tensor we mean the group of all invertible linear transformations of that leave in…