✦ LIBER ✦

A lower bound theorem for polytope pairs

✍ Scribed by M.R Emamy-Khansary

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 234 KB
Volume: 38
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90068-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound Theorem for Ehrhart Polyno

A Lower Bound Theorem for Ehrhart Polynomials of Convex Polytopes

✍ T. Hibi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 153 KB

A lower bound for Ramsey's theorem

✍ Joram Hirschfeld 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i

An Upper Bound Theorem for Rational Poly

An Upper Bound Theorem for Rational Polytopes

✍ Margaret M Bayer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The upper bound inequality h i (P)&h i&1 (P) ( n&d+i&2 i ) (0 i dÂ2) is proved for the toric h-vector of a rational convex d-dimensional polytope with n vertices. This gives nonlinear inequalities on flag vectors of rational polytopes. ## 1998 Academic Press A major result in polytope theory is th

On Huang Zhuping's theorem for a lower d

On Huang Zhuping's theorem for a lower displacement bound

✍ P.S. Symonds 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A Sharp Lower Bound in the Distortion Th

A Sharp Lower Bound in the Distortion Theorem for the Sakaguchi Class

✍ I.R. Nezhmetdinov 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 61 KB

A sharp lower bound is obtained for f Ј z in the class SSP of functions starlike with respect to symmetric points. As a consequence, some results are improved both for SSP and the class of uniformly starlike functions.

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