Home /  Workshop /  Schedules /  Around the lower bound theorem for polytope

Around the lower bound theorem for polytope

Geometric and topological combinatorics: Modern techniques and methods October 09, 2017 - October 13, 2017

October 11, 2017 (09:00 AM PDT - 10:00 AM PDT)
Speaker(s): Eran Nevo (The Hebrew University of Jerusalem)
Location: SLMath: Eisenbud Auditorium
  • polytope

  • f-vector

  • simplicial manifold

Primary Mathematics Subject Classification
Secondary Mathematics Subject Classification No Secondary AMS MSC



Starting from Barnette's classical lower bound theorem for simplicial polytopes (LBT), and its proof via framework rigidity by Kalai, I'll then discuss corresponding theorems and conjectures, as well as proof techniques, for sub-classes and super-classes of interest. For example, we'll consider centrally-symmetric simplicial polytopes, flag polytopes, cubical polytopes, polytopes with one non-simplex facet, general polytopes, and analogues for polyhedral spheres and manifolds.

29707?type=thumb Nevo Notes 2.97 MB application/pdf Download
Video/Audio Files


H.264 Video 9-Nevo.mp4 465 MB video/mp4 rtsp://videos.msri.org/data/000/029/597/original/9-Nevo.mp4 Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.