Among them Jeroen Zuiddam (Korteweg-de Vries Institute for Mathematics): Asymptotic spectra: from algebraic complexity theory to graph theory and beyond (SPECTRA)

When we repeat a task many times, how can we do it most efficiently? This simple question lies at the heart of many challenges in computer science, mathematics and physics: from finding faster computer algorithms, to determining the limits of data transmission in networks, to the optimal packing of geometric shapes. In his research project, Zuiddam will develop a mathematical framework (the asymptotic spectrum) to tackle such ‘economies-of-scale problems’. The asymptotic spectrum method was originally introduced by German mathematician and computer scientist Volker Strassen to understand matrix multiplication algorithms. Zuiddam has recently expanded the method into a unifying theory connecting fields as diverse as graph theory, quantum information and complexity theory. With this framework, he will seek breakthroughs on long-standing open problems, including new algorithms for matrix multiplication and sharper bounds on the Shannon capacity of graphs (a measure of network efficiency), and a deeper understanding of quantum entanglement.

Congratulations Jeroen!