The lower and upper bound problems for cubical polytopes (Q1209839): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:37, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The lower and upper bound problems for cubical polytopes |
scientific article |
Statements
The lower and upper bound problems for cubical polytopes (English)
0 references
16 May 1993
0 references
Recall that a cubical polytope is a polytope whose all facets are combinatorial cubes. The author presents a family of cubical polytopes for which the number of facets is very large in comparison to the number of vertices. The number is higher than a number conjectured by Kalai, Perles and Stanley. He also constructs a family of cubical polytopes with a small number of facets and formulates a lower bound conjecture for the number of facets of a cubical polytope.
0 references
vertex
0 references
cubical polytopes
0 references
number of facets
0 references
