✦ LIBER ✦

The number of faces of a simplicial convex polytope

✍ Scribed by Richard P Stanley

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 177 KB
Volume: 35
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(80)90050-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polytopal Approximation Bounding the Num

Polytopal Approximation Bounding the Number of k-Faces

✍ Károly Böröczky Jr. 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 246 KB

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

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

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

10 Points in Dimension 4 not Projectivel

10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope

✍ David Forge; Michel Las Vergnas; Peter Schuchert 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 61 KB

Using oriented matroids, and with the help of a computer, we have found a set of 10 points in R 4 not projectively equivalent to the vertices of a convex polytope. This result confirms a conjecture of Larman [6] in dimension 4.

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.