Nikhil Srivastava

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.

Nikhil Srivastav
Alma materUnion College
Yale University
Known forKadison-Singer problem
AwardsPólya Prize (2014)[1]
Scientific career
FieldsComputer Scientist
Mathematician
InstitutionsUniversity of California, Berkeley
ThesisSpectral Sparsification and Restricted Invertibility (2010)
Doctoral advisorDaniel Spielman[2]
Websitehttps://math.berkeley.edu/~nikhil/

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]

gollark: I HAVE suggested ideons previously. What of HBCalculator™?
gollark: I refuse.
gollark: ?
gollark: https://xerbo.net/img/TransitBinView.png
gollark: And yet

References
  1. SIAM: George Pólya Prize
  2. Nikhil Srivastava at the Mathematics Genealogy Project
  3. 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
  4. 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
  5. "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.