The lower and upper bound problems for cubical polytopes

DOI10.1007/BF02189315zbMath0771.52005OpenAlexW2123473523MaRDI QIDQ1209839

William Jockusch

Publication date: 16 May 1993

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

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

zbMATH Keywords

vertexnumber of facetscubical polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Related Items

Gaps in the numbers of vertices of cubical polytopes. I, Face numbers of barycentric subdivisions of cubical complexes, The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices, On the cone of \(f\)-vectors of cubical polytopes, Bipartite Rigidity, Neighborly cubical spheres and a cubical lower bound conjecture, A new cubical \(h\)-vector, Cubical subdivisions and local \(h\)-vectors, Lower bounds for cubical pseudomanifolds, Isocanted alcoved polytopes., Efficiently hex-meshing things with topology, On the cone of $f$-vectors of cubical polytopes, Cubulations, immersions, mappability and a problem of habegger, Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds, Bipartite rigidity, Subdivisions of shellable complexes, Subdivisions of shellable complexes, The almost simple cubical polytopes

Cites Work

• Unnamed Item
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• Convex polytopes without triangular faces
• The maximum numbers of faces of a convex polytope