CHRISTIAN IKENMEYER - MAX-PLANCK INSTITUTE FOR INFORMATICS -GEOMETRY, COMPUTATIONAL COMPLEXITY AND REPRESENTATION THEORY

Decompositions of tensors are ubiquitous in many areas of the sciences, and tensor rank problems are solved with the help of computers on a daily basis. Of fundamental interest in computational linear algebra is the rank of the matrix multiplication tensor.
In this talk, Dr Ikenmeyer will discuss tensor decompositions and matrix multiplication from a geometric and representation theoretic perspective. Moreover, he will explain the connection to geometric complexity theory, which is an ambitious approach initiated by Mulmuley and Sohoni in 2001 to resolve the famous P vs NP problem.

• Poster (1 MB)