Ramanujan Graphs and the Solution of the Kadison-Singer Problem

2014.

Cited by: 25|Bibtex|Views44
Other Links: academic.microsoft.com|arxiv.org

Abstract:

We survey the techniques used in our recent resolution of the Kadison-Singer problem and proof of existence of Ramanujan Graphs of every degree: mixed characteristic polynomials and the method of interlacing families of polynomials. To demonstrate the method of interlacing families of polynomials, we give a simple proof of Bourgain and ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments