Loading AI tools
From Wikipedia, the free encyclopedia
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.
Nikhil Srivastava | |
---|---|
Alma mater | Union College Yale University |
Known for | Kadison-Singer problem |
Awards | Pólya Prize (2014)[1] Michael and Sheila Held Prize (2021)[2] |
Scientific career | |
Fields | Computer Science Mathematics |
Institutions | University of California, Berkeley |
Thesis | Spectral Sparsification and Restricted Invertibility (2010) |
Doctoral advisor | Daniel Spielman[3] |
Website | math |
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").
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.
In 2022 The Ciprian Foias Prize in Operator Theory was awarded to Adam Marcus, Daniel Spielman, and Srivastava for their notable work in Operator Theory that was published in the preceding six years.[7][8]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.