The number of faces of polytope pairs and unbounded polyhedra
From MaRDI portal
Publication:1163744
DOI10.1016/S0195-6698(81)80037-6zbMath0484.52008MaRDI QIDQ1163744
Billera, Louis J., Carl W. Lee
Publication date: 1981
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
Rigidity and the lower bound theorem. I, \(f\)-vectors of triangulated balls, On the numbers of faces of low-dimensional regular triangulations and shellable balls, A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes, P.L.-spheres, convex polytopes, and stress, Two combinatorial properties of a class of simplicial polytopes, Enumeration in convex geometries and associated polytopal subdivisions of spheres
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of faces of a simplicial convex polytope
- The minimum number of faces of a simple polyhedron
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- Polytope pairs and their relationship to linear programming
- Hilbert functions of graded algebras
- A comparison of primal and dual methods of linear programming
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
- The minimum number of vertices of a simple polytope
- A proof of the lower bound conjecture for convex polytopes
- Sufficiency of McMullenâs conditions for đ-vectors of simplicial polytopes
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- A Combinatorial Analogue of Poincaré's Duality Theorem
- The maximum numbers of faces of a convex polytope
- A generalized lowerâbound conjecture for simplicial polytopes
- Shellable Decompositions of Cells and Spheres.