Codes and Expansions (CodEx) Seminar

Joshua A. Grochow (University of Colorado Boulder)
Codes and Expansions in Algorithms for Matrix Multiplication

We overview some relationships between codes (and various code-like objects) and constructing algorithms for multiplying matrices, ranging from concrete results to intriguing observations of things that look similar if you squint just right.

This includes a connection between codes and bilinear complexity from Lempel & Winograd '76, symmetric algorithms for matrix multiplication (studied by many authors), and a construction of Strassen's 1969 matrix multiplication algorithm from a unitary 2-design (G. & Moore, arXiv:1708.09398). And more connections we won't have time for, but promise at least one slide about.