Nondegenerate families of convex cones and convex polytopes
โ Scribed by Meir Katchalski
- Publisher
- Springer
- Year
- 1979
- Tongue
- English
- Weight
- 228 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This is an expository paper on connections between enumerative combinatorics and convex polytopes. It aims to give an essentially self-contained overview of five specific instances when enumerative combinatorics and convex polytopes arise jointly in problems whose initial formulation lies in only on
to branko gru nbaum in honor of his seventieth birthday An inner diagonal of a polytope P is a segment that joins two vertices of P and that lies, except for its ends, in P's relative interior. The paper's main results are as follows: (a) Among all d-polytopes P having a given number v of vertices,