Shephard–Kalai conjecture on subpolytopes of stacked polytopes
Statement
Let . A subpolytope of a polytope is the convex hull of a subset of its vertices, and a stacked polytope is a polytope obtained by starting with a simplex and successively stacking simplices onto facets. Shephard–Kalai conjecture. Every combinatorial type of -dimensional polytope can be realized using subpolytopes of -dimensional stacked polytopes. This conjecture is the combinatorial version of Shephard's question whether every polytope is a subpolytope of some stacked polytope; the geometric question was disproved by Shephard, while the combinatorial assertion remains open here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.