Recent contributions of algebraic geometry and representation theory to complexity theory
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Mathematical Challenges in Quantum Information
Algebraic 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 FoulkesHowe 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).
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
