COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## The solution of the Kadison-Singer ProblemAdd to your list(s) Download to your calendar using vCal - Daniel Spielman (Yale)
- Monday 01 June 2015, 17:00-18:00
- MR2, 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.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- CamTalks
- Centre for Health Leadership and Enterprise
- DPMMS Lists
- DPMMS info aggregator
- DPMMS lists
- DS list 1
- Faculty of Mathematics Lectures
- Featured lists
- Featured talks
- Guy Emerson's list
- MR2, CMS
- Major Public Lectures in Cambridge
- Mordell Lectures
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsBabraham Institute Events Vet School Seminars Biomimetic manufacturing and sustainability## Other talksKatherine Mansfield Physics and mathematics of marbling What has Engineering Design to say about Healthcare Improvement? Migration in Science Mathematical Approaches to Toys The Digital Railway - Network Rail |