Shephard's dimension-preserving subpolytope conjecture

A stacked polytope is a polytope obtained by repeatedly stacking simplices. A subpolytope is the convex hull of a subset of the vertices of a polytope. A combinatorial type records the face-incidence structure.

Shephard's conjecture. For every d0d\ge 0, every combinatorial type of dd-dimensional polytope can be realized using subpolytopes of dd-dimensional stacked polytopes.

The conjecture is the combinatorial form of Shephard's question after his geometric version was shown to be false; the source gives no resolution.

Sources & referencesView supporting material

Primary source

Karim Alexander Adiprasito, “Methods from Differential Geometry in Polytope Theory”, arXiv:1403.2657 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.