𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound on the shortness exponent of inscribable polytopes

✍ Scribed by Michael B Dillencourt

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
834 KB
Volume
46
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
✍ David Barnette πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d

Upper Bounds on the Maximal Number of Fa
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes
✍ TamΓ‘s Fleiner; Volker Kaibel; GΓΌnter Rote πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 157 KB

We prove two new upper bounds on the number of facets that a d-dimensional 0/1-polytope can have. The first one is 2(d -1)!+2(d -1) (which is the best one currently known for small dimensions), while the second one of O((d -2)!) is the best known bound for large dimensions.