The vertex-facet product conjecture for 2-level polytopes

Let PP be a 22-level dd-polytope, and let f0(P)f_0(P) and fd1(P)f_{d-1}(P) denote its numbers of vertices and facets, respectively. Vertex-facet product conjecture. For every 22-level dd-polytope PP,

f0(P)fd1(P)d2d+1.f_0(P)f_{d-1}(P)\leq d2^{d+1}.

Experiments establish the bound up to dimension 77, and it is known for several infinite classes of 22-level polytopes; the conjecture remains open in general.

Sources & referencesView supporting material

Primary source

Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia and Kanstantsin Pashkovich, “Enumeration of 2-level polytopes”, arXiv:1703.01943 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.