Lower Bounds on Extension Complexity of the Correlation Polytope

Series
Convex Algebraic Geometry Reading Seminar
Time
Friday, February 27, 2015 - 11:00am for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Greg Blekherman – Georgia Tech
Organizer
Greg Blekherman
I will present a new, simple and combinatorial proof by Kaibel and Weltge that the correlation polytope has exponential extension complexity.