ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥0d\ge 0. 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 dd-dimensional polytope can be realized using subpolytopes of dd-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.