Skip to main content
Log in

On the number of faces of centrally-symmetric simplicial polytopes

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

I. Bárány and L. Lovász [Acta Math. Acad. Sci. Hung.40, 323–329 (1982)] showed that ad-dimensional centrally-symmetric simplicial polytopeP has at least 2d facets, and conjectured a lower bound for the numberf i ofi-dimensional faces ofP in terms ofd and the numberf 0 =2n of vertices. Define integers\(h_0 ,...,h_d {\mathbf{ }}by{\mathbf{ }}\sum\limits_{i = 0}^d {f_{i - 1} } (x - 1)^{d - i} = \sum\limits_{i = 0}^d {h_i x^{d - i} } \) A. Björner conjectured (unpublished) that\(h_i \geqslant \left( {\begin{array}{*{20}c} d \\ i \\ \end{array} } \right)\) (which generalizes the result of Bárány-Lovász sincef d−1 =∑ h i ), and more strongly that\(h_i - h_{i - 1} \geqslant \left( {\begin{array}{*{20}c} d \\ i \\ \end{array} } \right) - \left( {\begin{array}{*{20}c} d \\ {i - 1} \\ \end{array} } \right),1 \leqslant i \leqslant \left\lfloor {{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \right\rfloor \), which is easily seen to imply the conjecture of Bárány-Lovász. In this paper the conjectures of Björner are proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bárány, I., Lovász, L.: Borsuk's theorem and the number of facets of centrally symmetric polytopes. Acta Math. Acad. Sci. Hung.40, 323–329 (1982)

    Google Scholar 

  2. Billera, L.J.: Polyhedral theory and commutative algebra. In: Mathematical Programming: The State of the Art, edited by A. Bachem, M. Grötschel, B. Korte, pp. 57–77. Berlin: Springer-Verlag 1986

    Google Scholar 

  3. Danilov, V.I.: The geometry of toric varieties. Russian Math. Surveys33, 97–154 (1978). Translated from Uspekhi Mat. Nauk.33, 85–134 (1978)

    Google Scholar 

  4. McMullen, P., Shephard, G.C.: Diagrams for centrally symmetric polytopes. Mathematika15, 123–138 (1968)

    Google Scholar 

  5. Mebkhout, Z.: Review # 86j: 32027. Math. Reviews 4541 (1986)

  6. Saito, M.: Hodge structure via filteredD-modules. Astérisque130, 342–351 (1985)

    Google Scholar 

  7. Schneider, R.: Neighbourliness of centrally symmetric polytopes in high dimensions. Mathematika22, 176–181 (1975)

    Google Scholar 

  8. Stanley, R.: Cohen-Macaulay complexes. In: Higher Combinatorics, edited by M. Aigner, pp. 51–62. Dordrecht-Boston: Reidel 1977

    Google Scholar 

  9. Stanley, R.: Commutative Algebra and Combinatorics. Progress in Mathematics 41. Boston-Basel-Stuttgart: Birkhauser 1983

    Google Scholar 

  10. Stanley, R.: The number of faces of simplicial polytopes and spheres. In: Discrete Geometry and Convexity, Ann. New York Acad. Sci. 440, edited by J.E. Goodman, et al., pp. 212–223. New York: New York Academy of Sciences 1985

    Google Scholar 

  11. Steenbrink, J.H.M.: Mixed Hodge structure on the vanishing cohomology. In: Real and Complex Singularities, Oslo 1976, edited by P. Holm, pp. 525–563. Alphen aan den Rijn: Sijtoff & Noordhoff 1977

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Partially supported by NSF grant MCS-8104855. The research was performed when the author was a Sherman Fairchild Distinguished Scholar at Caltech.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stanley, R.P. On the number of faces of centrally-symmetric simplicial polytopes. Graphs and Combinatorics 3, 55–66 (1987). https://doi.org/10.1007/BF01788529

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788529

Keywords