Nikhil Srivastava
| Nikhil Srivastava | |
|---|---|
 | |
| Fields |
Computer Scientist Mathematician |
| Institutions | University of California, Berkeley |
| Alma mater |
Union College Yale University |
| Thesis | Spectral Sparsification and Restricted Invertibility (2010) |
| Doctoral advisor | Daniel Spielman[1] |
| Known for | Kadison-Singer problem |
| Notable awards | Pólya Prize (2014)[2] |
Nikhil Srivastava has been an assistant professor of Mathematics at University of California, Berkeley since 2015. In July 2014 he was named a recipient of the Pólya Prize with Adam Marcus and Daniel Spielman.
Education
Nikhil Srivastava attended Union College in Schenectady, New York, graduating summa cum laude with a bachelor of science degree in mathematics and computer Science in 2005. He received a PhD in computer science from Yale University in 2010 (his dissertation was called "Spectral Sparsification and Restricted Invertibility").
Awards
In 2013, together with Adam Marcus and Daniel Spielman, he provided a positive solution to the Kadison–Singer problem,[3][4] a result that was awarded the 2014 Pólya Prize.
He gave an invited lecture at the International Congress of Mathematicians in 2014.[5]
References
- ↑ Nikhil Srivastava at the Mathematics Genealogy Project
- ↑ SIAM: George Pólya Prize
- ↑ Marcus, Adam W.; Spielman, Daniel A.; Srivastava, Nikhil (2015), "Interlacing families I: Bipartite Ramanujan graphs of all degrees", Annals of Mathematics 182 (1): 307–325, arXiv:1304.4132, doi:10.4007/annals.2015.182.1.7
- ↑ Marcus, Adam W.; Spielman, Daniel A.; Srivastava, Nikhil (2015), "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison–Singer problem", Annals of Mathematics 182 (1): 327–350, arXiv:1306.3969, doi:10.4007/annals.2015.182.1.8
- ↑ "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.
|