A lower bound theorem for centrally symmetric simplicial polytopes (Q1731457)

A well-known result of Stanley says that for any centrally symmetric simplicial \(d\)-polytope with \(d\ge 3\) the inequality \(g_2(P)\ge\binom{d}{2} -d\) holds, where \(g_2(P):= f_1-df_0+\binom{d+1}{2}\). The authors prove a characterization of centrally symmetric simplicial \(d\)-polytopes with \(d\ge 4\) which satisfy the inequality case, thus generalizing the lower bound theorem for simplicial polytopes to the setting of centrally symmetric simplicial polytopes. They use tools like infinitesimal rigidity of frameworks an polytopes and rigidity of centrally symmetric graphs. In a final part, interesting open problems and conjectures are posed.