Presented By: Department of Mathematics
Analysis/Probability Learning Seminar
The Kadison-Singer Problem Part 4: Convexity Property of Real Stable Polynomial
This will be the last part of proving Kadison-Singer Problem.
We will continue our proof of Marcus-Spielman-Srivastava theorem. Last time we reduced Marcus-Spielman-Srivastava theorem to an upper bound of maximum root for a real stable polynomial. In this talk, we will continue our discussion on convexity properties of real stable polynomials. From these convexity property, the distribution of maximum root is more or less preserved under some linear operator. Thus, one can derive Marcus-Spielman-Srivastava theorem using induction. Discussion of these real stable polynomial properties is independent of earlier talks and can be interesting by itself.
This talk is based on proof for Kadison-Singer Problem by Marcus, Spielman, Srivastava and notes of Terry Tao.
Speaker(s): Feng Wei (University of Michigan)
We will continue our proof of Marcus-Spielman-Srivastava theorem. Last time we reduced Marcus-Spielman-Srivastava theorem to an upper bound of maximum root for a real stable polynomial. In this talk, we will continue our discussion on convexity properties of real stable polynomials. From these convexity property, the distribution of maximum root is more or less preserved under some linear operator. Thus, one can derive Marcus-Spielman-Srivastava theorem using induction. Discussion of these real stable polynomial properties is independent of earlier talks and can be interesting by itself.
This talk is based on proof for Kadison-Singer Problem by Marcus, Spielman, Srivastava and notes of Terry Tao.
Speaker(s): Feng Wei (University of Michigan)
Explore Similar Events
-
Loading Similar Events...
