ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥4d\ge 4 be fixed. An ff-vector is a vector recording the face numbers of a dd-polytope, here written as

f=(1,f0,…,fd−1).f=(1,f_0,\ldots,f_{d-1}).

NP-hardness conjecture. It is NP-hard to decide if a given NN-bit vector f=(1,f0,…,fd−1)f=(1,f_0,\ldots,f_{d-1}) of positive integers is the ff-vector of a dd-polytope.

This conjecture is proposed as an explanation for why the ff-vectors of dd-polytopes are poorly understood when d≥4d\ge 4. Its status is not specified in the source.

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.