scientific article; zbMATH DE number 2068098

The authors call a convex \(d\)-polytope \(P\) {\(b\)-equifacetted} if all facets of \(P\) are combinatorially equivalent to the pyramid over the \((d-2)\)-dimensional cube. This paper proves that every \(b\)-equifacetted 4-polytope has at least ten vertices, and that there are exactly two combinatorial types with ten vertices (and that the same holds for \(b\)-equifacetted 3-spheres). The construction can be used to obtain \(b\)-equifacetted 4-polytopes with \(n\) vertices for every \(n\geq 10\). The authors also show that for \(d\geq 5\) the smallest numbers of vertices of \(b\)-equifacetted \(d\)-polytopes are \(2^{d-1}+2\) and \(2^{d-1}+2^{d-2}+2\), each realized for a unique combinatorial type. For the entire collection see [Zbl 1034.52002].

Recommendations

Cited in

(9)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464709)