The cubical d-polytopes with fewer than 2d+1 vertices
From MaRDI portal
Publication:1892413
DOI10.1007/BF02574048zbMATH Open0824.52013MaRDI QIDQ1892413FDOQ1892413
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Convex polytopes without triangular faces
- 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
Cited In (9)
- Isocanted alcoved polytopes.
- Gaps in the numbers of vertices of cubical polytopes. I
- The almost simple cubical polytopes
- A counterexample to the Hirsch conjecture
- On the cone of $f$-vectors of cubical polytopes
- Counting faces of cubical spheres modulo two
- Semi-algebraic sets of \(f\)-vectors
- Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)
- A new cubical \(h\)-vector
Recommendations
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)