Recent contributions of algebraic geometry and representation theory to complexity theory
Seminar Room 1, Newton Institute
AbstractAlgebraic geometry and representation theory have been used to prove lower bounds for the complexity of matrix multiplication, the complexity of linear circuits (matrix rigidity), and Geometric Complexity Theory (questions related to the conjecture that P is distinct from NP). Remarkably, these questions in computer science are related to classical questions in algebraic geometry regarding objects such as dual varieties, secant varieties, Darboux hypersurfaces, and classical intersection theory, as well as questions in representation theory such as the Foulkes-Howe conjecture and the asymptotic study of Kronecker coefficients. I will give an overview of my joint work with G. Ottaviani (matrix multiplication), L. Manivel and N. Ressayre (GCT) and F. Gesmundo, J. Hauenstein, and C. Ikenmeyer (linear circuits).
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.