ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a polytope, let ii be a face dimension, and let HH be a hyperplane. For a central hyperplane H0H_0, write H0+H_0^+ for one of the associated halfspaces.

Hardness conjecture. (i) It is NPNP-hard to find a hyperplane HH which maximizes the number of ii-dimensional faces of P∩HP\cap H. (ii) It is #P\#P-hard to find a hyperplane HH which maximizes the volume of the orthogonal projection of PP onto HH. (iii) It is NPNP-hard to find a central hyperplane H0H_0 which maximizes the volume of the halfspace section P∩H0+P\cap H_0^+.

The paper first establishes related NPNP-hardness results for weighted edge sections and vertex halfspace sections, and then proposes these stronger unweighted and general-dimensional claims. The projection claim is motivated by the hardness of computing zonotope volumes, which implies hardness for volumes of projections of polytopes; the conjectured resolutions of the displayed claims are not supplied 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.