Construction theorems for polytopes (Q797835)

This is an interesting contribution to the Steinitz problem, that is, the problem of characterizing, in a combinatorial way, the boundary complexes of higher dimensional convex polytopes. The authors describe, in their three main theorems, certain constructions which yield, starting from a d-dimensional polytope with n vertices, a collection of d-dimensional polytopes with \(n+1\) vertices. Even though one knows that not every polytope can be derived from a simplex by iterating these constructions, they still have brought us closer to a better understanding, and perhaps to a solution, of the classification problem for combinatorial types of convex polytopes.