AI Chat AI Image Generator AI Video Text to Speech

Non-existence of a short algorithm for multiplication of 3×3 matrices with group S_4× S_3, II

11/08/2022

∙

by Vladimir P. Burichenko, et al.

∙

∙

It is proved that there is no an algorithm for multiplication of 3×3 matrices of multiplicative length ≤23 that is invariant under a certain group isomorphic to S_4× S_3. The proof makes use of description of the orbits of this group on decomposable tensors in the tensor cube (M_3(ℂ))^⊗3 which was obtained earlier.

page 1

page 2

page 3

page 4

research

∙ 11/07/2022

Non-existence of a short algorithm for multiplication of 3×3 matrices with group S_4× S_3

One of prospective ways to find new fast algorithms of matrix multiplica...

0 Vladimir P. Burichenko, et al. ∙

research

∙ 08/27/2017

Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective

Despite its importance, all proofs of the correctness of Strassen's famo...

0 Christian Ikenmeyer, et al. ∙

research

∙ 11/11/2022

On automorphism group of a possible short algorithm for multiplication of 3×3 matrices

Studying algorithms admitting nontrivial symmetries is a prospective way...

0 Vladimir Burichenko, et al. ∙

research

∙ 10/29/2022

The isotropy group of the matrix multiplication tensor

By an isotropy group of a tensor t∈ V_1 ⊗ V_2⊗ V_3=V we mean the group o...

0 V. P. Burichenko, et al. ∙

research

∙ 01/29/2021

The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

We present a non-commutative algorithm for the product of 3x5 by 5x5 mat...

0 Alexandre Sedoglavic, et al. ∙

research

∙ 06/30/2022

Group-invariant tensor train networks for supervised learning

Invariance has recently proven to be a powerful inductive bias in machin...

0 Brent Sprangers, et al. ∙

research

∙ 10/08/2022

The FBHHRBNRSSSHK-Algorithm for Multiplication in ℤ_2^5×5 is still not the end of the story

In response to a recent Nature article which announced an algorithm for ...

0 Manuel Kauers, et al. ∙