The cubical d-polytopes with fewer than 2d+1 vertices
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).
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- Convex polytopes without triangular faces
- Cubical 4-polytopes with few vertices
- Cubical \(d\)-polytopes with few vertices for \(d>4\)
- Gaps in the numbers of vertices of cubical polytopes. I
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- The lower and upper bound problems for cubical polytopes
- The number of faces of a simplicial convex polytope
- Gaps in the numbers of vertices of cubical polytopes. I
- Cubical \(d\)-polytopes with few vertices for \(d>4\)
- Cubical 4-polytopes with few vertices
- The almost simple cubical polytopes
- A new cubical h-vector
- Counting faces of cubical spheres modulo two
- Isocanted alcoved polytopes.
- Semi-algebraic sets of \(f\)-vectors
- On the cone of \(f\)-vectors of cubical polytopes
- Convex polytopes without triangular faces
- A counterexample to the Hirsch conjecture
- On the cone of f-vectors of cubical polytopes
- Lower bounds for cubical pseudomanifolds
- Isocanted cube: the lower Lebesgue volumes, incidence numbers and symmetries of this d-dimensional tile
- Minimum-cardinality triangulations of the d-cube for d=5 and d=6
This page was built for publication: The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892413)
