Computer Science/Discrete Mathematics Seminar I

In this second lecture in my series on asymptotic spectra we will focus on one application: the matrix multiplication problem. We will use the asymptotic spectrum of tensors to prove that a very general method (that includes the methods used to obtain the currently best algorithms) cannot give faster matrix multiplication algorithms. Keywords are Shannon entropy, representation theory and moment polytopes, but prior knowledge of these is not assumed.