University of Cambridge > Talks.cam > Mordell Lectures > The solution of the Kadison-Singer Problem

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The solution of the Kadison-Singer Problem

Download to your calendar using vCal

  • UserDaniel Spielman (Yale)
  • ClockMonday 01 June 2015, 17:00-18:00
  • HouseMR2, CMS.

If you have a question about this talk, please contact HoD Secretary, DPMMS .

In 1959, Kadison and Singer posed a problem in operator theory that has reappeared in many guises, including the Paving Conjecture, the Bourgain-Tzafriri Conjecture, the Feichtinger Conjecture, and Weaver’s Conjecture. I will explain how we solve the Kadison-Singer Problem by proving Weaver’s Conjecture in Discrepancy Theory.

I will explain the “method of interlacing polynomials” that we introduced to solve this problem, and sketch the major steps in the proof. These are the introduction of “mixed characteristic polynomials”—-the expected characteristic polynomials of a sum of random symmetric rank-1 matrices, the proof that these polynomials are real rooted, and the derivation of an upper bound on their largest roots.

These techniques are elementary, and should be understandable to a broad mathematical audience.

This is joint work with Adam Marcus and Nikhil Srivastava.

A wine reception will follow the talk in the Central Core, CMS

This talk is part of the Mordell Lectures series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Sociolinguistics Circle King's College cafe Webinar & LT2, Computer Laboratory, William Gates Building.

Other talks

Online Causal Inference Seminar The organisational management of traumatic stress Dinner The Imagined Conflict: On Science and God Formal Dinner at Selwyn College Genomic Medicine CPC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity