The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices

DOI10.1007/BF02574048zbMath0824.52013MaRDI QIDQ1892413

Gerd Blind, Roswitha Blind

Publication date: 2 July 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131366

zbMATH Keywords

\(f\)-vectorface complexcubical polytopes

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Related Items (5)

A counterexample to the Hirsch conjecture ⋮ Isocanted alcoved polytopes. ⋮ On the cone of $f$-vectors of cubical polytopes ⋮ Semi-algebraic sets of \(f\)-vectors ⋮ The almost simple cubical polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• The lower and upper bound problems for cubical polytopes
• 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
• Convex polytopes without triangular faces

This page was built for publication: The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices