A Proof of Grünbaum’s Lower Bound Conjecture for polytopes, lattices, and strongly regular pseudomanifolds.

Abstract: In 1967, Grünbaum conjectured that any $d$-dimensional polytope with $d + s \leq 2d$ vertices has at least $\phi_k (d + s, d) = {d + 1 \choose k + 1} + { d \choose k + 1} - { d + 1 - s \choose k + 1}$ $k$-faces. In the talk, we will prove this conjecture and discuss equality cases. We will then extend our results to lattices with diamond property (the inequality part) and to strongly regular normal pseudomanifolds (the equality part). We will also talk about recent results on $d$-dimensional polytopes with $2d + 1$ or $2d + 2$ vertices.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456