Nikhil Srivastava, a young Indian mathematician has been named the winner of the 2021 Michael and Sheila Held Prize. Nikhil who is working at the University of California has been awarded the Michael and Sheila Held Prize with other mathematicians for solving long-standing questions on the Kadison-Singer problem & on Ramanujan graphs.
"Nikhil Srivastava, a young Indian mathematician, has been named the winner of 2021 Michael and Sheila Held Prize for solving long-standing questions on the Kadison-Singer problem & on Ramanujan graphs. Congratulations Nikhil", writes Union Education Minister Dr. Ramesh Nishank Pokhriyal.
Nikhil was born in New Delhi in 1983 and has attended educational institutions across the world as his father worked in Foreign Servies. Srivastava who at present working as an associate professor of mathematics at the University of California, Berkely wins the award for solving a problem on Ramanujan Graphs. Nikhil is among the winners of the prestigious award, announced on Sunday, January 24, by announces National Academy of Sciences. Adam W Marcus, EPFL (Swiss Federal Institute of Technology, Lausanne), and Daniel Alan Spielman, Yale University are the other two winners.
According to a report published by the National Academy of Sciences their groundbreaking papers on these questions, both published in 2015, solved problems that mathematicians had been working on for several decades. In particular, their solution to the Kadison-Singer problem, first posited in 1959, has been hailed as one of the most important developments in the mathematics of the past decade.
NAS in its statement stated that Srivastava along with Marcu and Spielman solved longstanding questions on the Kadison-Singer problem and on Ramanujan graphs, and in-process uncovered a deep new connection between linear algebra, the geometry of polynomials, and graph theory that inspired the next generation of theoretical computer scientists.
About the Michael and Sheila Held Prize: The prize is presented annually and carries with it a $100,000 prize. The prize honors outstanding, innovative, creative, and influential research in the areas of combinatorial and discrete optimization, or related parts of computer science, such as the design and analysis of algorithms and complexity theory.
Source- National Academy of Sciences