Pineda-Villavicencio's lower-bound conjecture for polytopes with 2d+ℓ vertices
Statement
Let and . Let be a -polytope with vertices, and let denote the -simplex. Pineda-Villavicencio's conjecture.
- If has at least facets, then
for each with . 2. If has facets, then is a -fold pyramid over for some and .
The conjecture refines the proposed minimisers for -polytopes with at most vertices. The paper states that it resolves this conjecture in full; the cases and had already been settled, and every minimiser in part (i) is shown to have exactly facets.
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.