On automorphism group of a possible short algorithm for multiplication of 3×3 matrices
Abstract
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 there exists an algorithm of multiplicative length l≤22 for multuplication of 3×3 matrices then its automorphism group is isomorphic to a subgroup of Sl× S3.
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.