Combinatorics Seminar

When: Sunday, December 3, 10am
Where: Schreiber 309
Speaker: Gil Kalai, Hebrew University
Title: The combinatorics of convex polytopes via linear programming and beyond


I will show how the basic properties of linear programming lead to deep and beautiful combinatorial theorems  about convex polytopes. I will discuss especially the upper bound theorem and the reconstruction of the full combinatorics of  simple polytopes from their graphs.