The Kadison-Singer (KS) Problem was a famous open problem in the theory of operator algebras, posed in 1959.
It was recently (and completely unexpectedly) solved (in the affirmative) by three computer scientists:
Adam Marcus, Daniel Spielman, and Nikhil Srivastava (MSS). Their proof is both novel and elementary, though intricate.
In this talk I will: (1) explain the KS problem;
(2) explain its reformulation by Joel Anderson as a problem about paving zero-diagonal matrices; and,
(3) outline the MSS proof of the paving problem. The talk should be accessible to a general mathematical audience.
This colloquium will be held in
7800 York Road,
Room 320 at 4:00 p.m., with light refreshments served at 3:30 p.m.