The lower and upper bound problems for cubical polytopes (Q1209839)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 168599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The lower and upper bound problems for cubical polytopes |
scientific article; zbMATH DE number 168599 |
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
0.9237385
0 references
0.91637635
0 references
0 references
0.9023614
0 references
0.90203804
0 references
0.90172577
0 references
0.8985931
0 references
0.89856005
0 references
