Nikhil Srivastava
Nikhil Srivastava is an Indian mathematician and computer scientist who studies combinatorics , linear algebra, convex geometry and random matrices. He has been an Assistant Professor at the University of California, Berkeley since 2015 .
Srivastava studied mathematics at Union College in Schenectady in New York with a bachelor's degree in 2005 and received his doctorate in 2010 from Yale University under Daniel Spielman ( spectral sparsification and restricted invertibility ). As a post-doctoral student , he was at the Institute for Advanced Study , MSRI and Princeton University (2012). He then went to Microsoft Research in Bangalore , India.
In 2013 he solved the Kadison-Singer problem with Daniel Spielman and Adam W. Marcus (see Richard Kadison ), for which all three received the George Pólya Prize in 2014 . All three were invited speakers at the 2014 International Congress of Mathematicians in Seoul.
Fonts
- with Adam Marcus, Nikhil Srivastava: Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees . In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) . 2013, p. 529-537 , doi : 10.1109 / FOCS.2013.63 , arxiv : 1304.4132 .
- with Adam Marcus, Nikhil Srivastava: Interlacing families II: mixed characteristic polynomials and the Kadison-Singer problem. In: arXiv Mathematics - Combinatorics. 2013, arxiv : 1306.3969
- with Adam Marcus, Nikhil Srivastava: Ramanujan Graphs and the Solution of the Kadison-Singer Problem. In: arXiv Mathematics - Spectral Theory. 2014, arxiv : 1408.4421
Web links
| personal data | |
|---|---|
| SURNAME | Srivastava, Nikhil |
| BRIEF DESCRIPTION | Indian mathematician and computer scientist |
| DATE OF BIRTH | 20th century |