The cubical d-polytopes with fewer than 2d+1 vertices
From MaRDI portal
Publication:1892413
Recommendations
Cites work
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- 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
- The lower and upper bound problems for cubical polytopes
- The number of faces of a simplicial convex polytope
Cited in
(12)- Isocanted alcoved polytopes.
- Convex polytopes without triangular faces
- On the cone of \(f\)-vectors of cubical polytopes
- On the cone of \(f\)-vectors of cubical polytopes
- Gaps in the numbers of vertices of cubical polytopes. I
- A counterexample to the Hirsch conjecture
- The almost simple cubical polytopes
- Lower bounds for cubical pseudomanifolds
- Counting faces of cubical spheres modulo two
- Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)
- Semi-algebraic sets of \(f\)-vectors
- A new cubical h-vector
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)