A census of flag-vectors of 4-polytopes (Q4518983)

The authors describe here what was known at the time of writing about flag-vectors of 4-polytopes. These can be parametrized by the sequences \((f_0,f_1,f_3,f_{03})\), with \(f_j\) the number of \(j\)-faces of a polytope \(P\), and \(f_{03}\) the number of its vertex-facet incidences. They begin with a family of inequalities. However, these cannot all be correct: the authors combine them to obtain the inequality ``\(f_0(f_0- 3)\geq 10f_3\)'', whereas replacing ``10'' by ``2'' gives the known sharp inequality resulting from the upper bound theorem. They also list many sequences, for small values of \(f_0\), which cannot occur as flag-vectors. For the entire collection see [Zbl 0944.00089].