The spanning conjecture for f-vectors of ordinary polytopes

From papers

Let dd be an odd integer with d5d\ge 5. An ordinary dd-polytope is a polytope whose face structure is governed by the ordinary-polytope construction; write fif_i for the number of its ii-dimensional faces. The Euler hyperplane is the affine hyperplane

i=0d1fi=2.\sum_{i=0}^{d-1}f_i=2.

Spanning conjecture. The set of ff-vectors of all ordinary dd-polytopes spans the Euler hyperplane. A spanning set consists of the ordinary polytopes

Pd,d+i/2,d+i,1id.P^{d,d+\lfloor i/2\rfloor,d+i},\qquad 1\le i\le d.

This predicts that these explicitly specified ordinary polytopes provide enough ff-vectors to span all admissible directions in the Euler hyperplane. The supplied text gives no resolution, so the conjecture is left open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Margaret M. Bayer, Aaron M. Bruening and Joshua Stewart, “A combinatorial study of multiplexes and ordinary polytopes”, arXiv:math/0101076 (2001).

Solutions 0

No solutions have been posted yet.