Thu Nov 19 · 4:30pm
Applied Math Colloquium: Nikhil Srivastava (UC Berkeley)
Nikhil Srivastava of the University of California, Berkeley gives MIT's Applied Math Colloquium. With Adam Marcus and Daniel Spielman he resolved the Kadison–Singer problem in 2013, work recognised with the 2014 George Pólya Prize and the 2021 Michael and Sheila Held Prize. His research spans spectral graph theory, random matrices and numerical linear algebra, and includes the theory of spectral sparsification of graphs.