10 citations · 19 across the 6 of their papers we have counts for
6 papers
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…
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…
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…
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…
Symmetries of matrix multiplication algorithms. I
V. P. Burichenko
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 fou…
On symmetries of the Strassen algorithm
Vladimir P. Burichenko
We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the di…