𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polytopal Approximation Bounding the Number of k-Faces

✍ Scribed by Károly Böröczky Jr.

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
246 KB
Volume
102
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Faces of Certain Transp
On the Number of Faces of Certain Transportation Polytopes
✍ Igor Pak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Define the transportation polytope T n,m to be a polytope of non-negative n × m matrices with row sums equal to m and column sums equal to n. We present a new recurrence relation for the numbers f k of the k-dimensional faces for the transportation polytope T n,n+1 . This gives an efficient algorith

Umbrellas and Polytopal Approximation of
Umbrellas and Polytopal Approximation of the Euclidean Ball
✍ Yehoram Gordon; Shlomo Reisner; Carsten Schütt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 335 KB

There are two positive, absolute constants c 1 and c 2 so that the volume of the difference set of the d-dimensional Euclidean ball B d 2 and an inscribed polytope with n vertices is larger than for n (c 2 d) (d&1)Â2 . 1997 Academic Press We study here the approximation of a convex body in R d by

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.

On the Number of Lattice Free Polytopes
On the Number of Lattice Free Polytopes
✍ Imre Bárány; Jean-Michel Kantor 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 110 KB

asked for estimates for the number of equivalence classes of lattice polytopes, under the group of unimodular affine transformations. What we investigate here is the analogous question for lattice free polytopes. Some of the results: the number of equivalence classes of lattice free simplices of vol

Bounding the Number of Geometric Permuta
Bounding the Number of Geometric Permutations Induced byk-Transversals
✍ Jacob E. Goodman; Richard Pollack; Rephael Wenger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 352 KB

We prove that a suitably separated family of n compact convex sets in R d can be met by k-flat transversals in at most d&k) , or for fixed k and d, O(n k(k+1)(d&k) ) different order types. This is the first non-trivial upper bound for 12.