Nikhil Srivastava

Nikhil Srivastava is a mathematician and computer scientist noted for contributions to operator theory, spectral graph theory, and randomized algorithms. He is best known for a key role in resolving the Kadison–Singer problem and for developments linking combinatorial constructions with functional analysis and theoretical computer science. His work spans collaborations with figures and institutions across Princeton University, Massachusetts Institute of Technology, Microsoft Research, and University of California, Berkeley.

Early life and education

Srivastava completed undergraduate and graduate studies at institutions recognized for mathematics and computer science: Massachusetts Institute of Technology and Princeton University. At Princeton University he worked under the supervision of Daniel Spielman, engaging with topics at the intersection of operator theory, spectral graph theory, and randomized algorithms. His doctoral training connected him to research communities associated with Institute for Advanced Study, Simons Foundation, National Science Foundation, and other academic centers that fostered collaborations among scholars such as Adam Marcus and Daniel Spielman.

Research and career

Srivastava's career includes appointments and collaborations at Microsoft Research, University of California, Berkeley, and other research centers linked to Stanford University and Harvard University seminars. His research integrates techniques from functional analysis, probability theory, and combinatorics to address problems in operator algebras, signal processing, and theoretical computer science. He has collaborated with researchers across projects relating to graph sparsification, random matrix theory, and deterministic constructions with implications for John von Neumann-era questions, interacting with communities that include scholars affiliated with Columbia University, Yale University, University of Chicago, and New York University.

Kadison–Singer problem and interlacing families

Srivastava is a principal author of the proof resolving the Kadison–Singer problem, a decades-old conjecture originating from a 1959 question in operator algebras posed by Richard Kadison and Isadore Singer. Working with Adam Marcus and Daniel Spielman, he helped develop the method of interlacing families of polynomials and applied techniques from real stable polynomials, mixed characteristic polynomials, and determinantal inequalities. The trio’s approach connected the Kadison–Singer conjecture to problems in paving conjectures and Feichtinger conjecture-type statements, while also yielding results for Bourgain–Tzafriri conjecture and for constructions related to Ramanujan graphs and expander graphs. Their work situated classical problems in C*-algebras and von Neumann algebras within a combinatorial and algebraic framework shared with researchers at Institute for Advanced Study, Princeton University, and Courant Institute.

Awards and honors

For the resolution of the Kadison–Singer problem and related advances, Srivastava and collaborators received recognition from mathematical societies and foundations associated with American Mathematical Society, Society for Industrial and Applied Mathematics, and prizes linked to achievements in mathematics and theoretical computer science. Honors acknowledged connections to influential results like the construction of Ramanujan graphs and progress on the Kadison–Singer problem, with citations referencing work celebrated at venues including International Congress of Mathematicians, Simons Foundation symposia, and events sponsored by National Academy of Sciences panels.

Selected publications and contributions

- Marcus, Adam; Spielman, Daniel; Srivastava, Nikhil — papers introducing interlacing families and proving results equivalent to the Kadison–Singer problem, influencing research on random matrix theory, spectral graph theory, and deterministic constructions like Ramanujan graphs. - Work connecting interlacing methods to the Bourgain–Tzafriri conjecture, Feichtinger conjecture, and consequences for frame theory in signal processing and harmonic analysis. - Contributions to literature on graph sparsification, matrix concentration inequalities, and applications to algorithms studied at centers such as Microsoft Research, Princeton University, and University of California, Berkeley.

Category:American mathematicians Category:Theoretical computer scientists