zbMATH — the first resource for mathematics

The number of faces of a simplicial convex polytope. (English) Zbl 0427.52006

52Bxx Polytopes and polyhedra
Full Text: DOI
[1] \scL. J. Billera and C. W. Lee, Sufficiency of McMullen’s conditions for f-vectors of simplicial polytopes, preprint. · Zbl 0479.52006
[2] Danilov, V.I, The geometry of toric varieties, Russian math. surveys, Uspekhi mat. nauk., 33, No. 2, 85-134, (1978), translated from · Zbl 0425.14013
[3] Griffiths, P; Harris, J, Principles of algebraic geometry, (1978), Wiley New York · Zbl 0408.14001
[4] Kempf, G; Knudsen, F; Mumford, D; Saint-Donat, B, Toroidal embeddings I, () · Zbl 0271.14017
[5] Macaulay, F.S, Some properties of enumeration in the theory of modular systems, (), 531-555 · JFM 53.0104.01
[6] McMullen, P, The numbers of faces of simplicial polytopes, Israel J. math., 9, 559-570, (1971) · Zbl 0209.53701
[7] McMullen, P; Shephard, G.C, Convex polytopes and the upper bound conjecture, () · Zbl 0217.46702
[8] Stanley, R, The upper bound conjecture and Cohen-Macaulay rings, Studies in applied math., 54, 135-142, (1975) · Zbl 0308.52009
[9] Stanley, R, Hilbert functions of graded algebras, Advances in math., 28, 57-83, (1978) · Zbl 0384.13012
[10] \scR. Stanley, Weyl groups, the hard Lefschetz theorem, and the Sperner property, SIAM J. Algebraic Discrete Methods, in press. · Zbl 0502.05004
[11] Steenbrink, J.H.M, Mixed Hodge structure on the vanishing cohomology, (), 525-563 · Zbl 0373.14007
[12] Teissier, B, Du théorème de l’index de Hodge aux inégalités isopérimétriques, C. R. acad. sci. Paris ser. A, 288, 287-289, (1979) · Zbl 0406.14011
[13] Demazure, M, Sous-groupes algébriques de rang maximum du groupe de Cremona, Ann. scient. éc. norm. sup., 3, 507-588, (1970) · Zbl 0223.14009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.