Nikhil Srivastava

Nikhil Srivastava
Nikhil Srivastava
Alma mater	Union College; Yale University
Known for	Kadison-Singer problem
Awards	Pólya Prize (2014); Michael and Sheila Held Prize (2021)
	Scientific career
Fields	Computer Scientist; Mathematician
Institutions	University of California, Berkeley
Thesis	Spectral Sparsification and Restricted Invertibility (2010)
Doctoral advisor	Daniel Spielman
Website	https://math.berkeley.edu/~nikhil/

Nikhil Srivastava is an associate professor of Mathematics at University of California, Berkeley. In July 2014, he was named a recipient of the Pólya Prize with Adam Marcus and Daniel Spielman.

Early life and education

Nikhil Srivastava was born New Delhi, India. He 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,^[4]^[5] a result that was awarded the 2014 Pólya Prize.

He gave an invited lecture at the International Congress of Mathematicians in 2014.^[6] He jointly won the 2021 Michael and Sheila Held Prize along with two others for solving long-standing questions on the Kadison-Singer problem and on Ramanujan graphs.[1]

References

^ SIAM: George Pólya Prize
^ "National Academy of Sciences - Michael and Sheila Prize".
^ Nikhil Srivastava at the Mathematics Genealogy Project
^ 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, S2CID 17580893
^ "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.

P ≟ NP

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

[1] SIAM: George Pólya Prize

[2] "National Academy of Sciences - Michael and Sheila Prize".

[3] Nikhil Srivastava at the Mathematics Genealogy Project

[4] 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

[5] 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, S2CID 17580893

[6] "ICM Plenary and Invited Speakers since 1897". International Congress of Mathematicians.

[1]

[2]

[3]

[4]

[5]

[6]