Non-existence of a short algorithm for multiplication of 3×3 matrices with group S4× S3, II
Abstract
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 S4× S3. The proof makes use of description of the orbits of this group on decomposable tensors in the tensor cube (M3( C))3 which was obtained earlier.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.