For convex d-polytope P let ft{P) equal the number of faces of P of dimension i, 0 < i < d 1. f(P) = (f0(P)9 . . . , fd^QP)) is called the f vector of P An important combinatorial problem is the characterization of the class of all /-vectors of polytopes, and in particular of simplicial polytopes (i.e. those for which each facet is a simplex). McMuUen in [5] conjectures a set of necessary and sufficient conditions for (/0, . • . 9fd~i) to be the/-vector of a simplicial d-polytope and proves this conjecture in the case of polytopes with few vertices. We sketch here a proof of the sufficiency of these conditions, and derive in a related way a general solution to an upper bound problem posed by Klee. The /-vectors of simplicial <i-polytopes satisfy the Dehn-Sommerville equations
[1]
N. Jacobson.
Lectures In Abstract Algebra
,
1951
.
[2]
G. C. Shephard,et al.
Convex Polytopes
,
1969,
The Mathematical Gazette.
[3]
P. McMullen.
The numbers of faces of simplicial polytopes
,
1971
.
[4]
P. McMullen,et al.
A generalized lower-bound conjecture for simplicial polytopes
,
1971
.
[5]
I. G. MacDonald,et al.
CONVEX POLYTOPES AND THE UPPER BOUND CONJECTURE
,
1973
.
[6]
V. Klee.
Polytope pairs and their relationship to linear programming
,
1974
.
[7]
R. Stanley.
The Upper Bound Conjecture and Cohen‐Macaulay Rings
,
1975
.