ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d⩾3d\geqslant 3 and 1⩽ℓ⩽d−11\leqslant\ell\leqslant d-1. Let PP be a dd-polytope with 2d+ℓ2d+\ell vertices, and let T(r)T(r) denote the rr-simplex. Pineda-Villavicencio's conjecture.

  1. If PP has at least d+3d+3 facets, then
fk(P)⩾fk(J(ℓ+1,d))f_k(P)\geqslant f_k(J(\ell+1,d))

for each kk with 1⩽k⩽d−21\leqslant k\leqslant d-2. 2. If PP has d+2d+2 facets, then PP is a (d−a)(d-a)-fold pyramid over T(m)×T(a−m)T(m)\times T(a-m) for some 2⩽a⩽d2\leqslant a\leqslant d and 2⩽m⩽\floora/22\leqslant m\leqslant\floor{a/2}.

The conjecture refines the proposed minimisers for dd-polytopes with at most 3d−13d-1 vertices. The paper states that it resolves this conjecture in full; the cases ℓ=1\ell=1 and ℓ=2\ell=2 had already been settled, and every minimiser in part (i) is shown to have exactly d+3d+3 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 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.