Ramanujan Graphs and the Solution of the Kadison-Singer Problem

zbMath1373.05108arXiv1408.4421MaRDI QIDQ5371303

Nikhil Srivastava, Daniel A. Spielman, Adam W. Marcus

Publication date: 25 October 2017

Full work available at URL: https://arxiv.org/abs/1408.4421

zbMATH Keywords

restricted invertibilityKadison-SingerRamanujan graphsinterlacing polynomialsmixed discriminantsmixed characteristic polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General theory of (C^*)-algebras (46L05) Real polynomials: location of zeros (26C10)

Related Items (13)

Lower bounds for the smallest singular value of structured random matrices ⋮ Detecting Fourier subspaces ⋮ Interlacing families. III: Sharper restricted invertibility estimates ⋮ Graphs, Vectors, and Matrices ⋮ Anderson-Bernoulli localization at large disorder on the 2D lattice ⋮ Boosted optimal weighted least-squares ⋮ Full spark frames in the orbit of a representation ⋮ Restricted Invertibility Revisited ⋮ Signatures, Lifts, and Eigenvalues of Graphs ⋮ Cheeger constants, structural balance, and spectral clustering analysis for signed graphs ⋮ The legacy of Jean Bourgain in geometric functional analysis ⋮ Spaces of Lorentzian and real stable polynomials are Euclidean balls ⋮ Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem

This page was built for publication: Ramanujan Graphs and the Solution of the Kadison-Singer Problem