The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices (Q1892413): Difference between revisions

A convex \(d\)-polytope is said to be cubical if every facet of it is a combinatorial cube. For the \(f\)-vectors of cubical polytopes the relation \(f_ j (P)\geq f_ j (C)\) is known, where \(P\) denotes the general cubical polytope and \(C\) the combinatorial cube, and that \(f_ 0 (P)\) is even for all even \(d\geq 4\). The authors determine all the possible values for \(f_ 0 (P)\) up to \(2^{d+1}\), and they give a complete enumeration of all cubical \(d\)-polytpes with fewer than \(2^{d+1}\) vertices for \(d\geq 4\). It turns out that these polytopes are so-called elementary ones. (Roughly speaking, a \(k\)-elementary cubical \(d\)-polytope \(P^ d_ k\), \(0\leq k\leq d\), is the union of \(k+1\) combinatorial \(d\)- cubes having a common \((d-k)\)-face).