Skip to main content
Log in

Construction theorems for polytopes

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

Certain construction theorems are represented, which facilitate an inductive combinatorial construction of polytopes. That is, applying the constructions to ad-polytope withn vertices, given combinatorially, one gets many combinatoriald-polytopes—and polytopes only—withn+1 vertices. The constructions are strong enough to yield from the 4-simplex all the 1330 4-polytopes with up to 8 vertices.

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

Access this article

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. A. Altshuler and M. A. Perles,Quotient polytopes of cyclic polytopes, Part I, Isr. J. Math.36 (1980), 97–125.

    MATH  MathSciNet  Google Scholar 

  2. A. Altshuler and L. Steinberg,Neighborly 4-polytopes with 9 vertices, J. Comb. Theory (A)15 (1973), 270–287.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Altshuler and L. Steinberg,Enumeration of the quasisimplicial 3-spheres and 4-polytopes with eight vertices, Pac. J. Math., to appear.

  4. A. Altshuler and L. Steinberg,The complete enumeration of the 4-polytopes and 3-spheres with eight vertices, Pac. J. Math., to appear.

  5. D. Barnette,Projections of 3-polytopes, Isr. J. Math.8 (1970), 304–308.

    Article  MATH  MathSciNet  Google Scholar 

  6. D. Barnette,A family of neighborly polytopes, Isr. J. Math.39 (1981), 127–140.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Danaraj and V. Klee,Which spheres are shellable? Ann. Discrete Math.2 (1978), 33–52.

    Article  MATH  MathSciNet  Google Scholar 

  8. B. Grünbaum,Convex Polytopes, Interscience, London/New York/Sydney, 1967.

    MATH  Google Scholar 

  9. B. Grünbaum and V. P. Sreedharan,An enumeration of simplicial 4-polytopes with 8 vertices, J. Comb. Theory2 (1967), 437–465.

    Article  MATH  Google Scholar 

  10. P. Kleinschmidt and U. Pachner,Shadow-boundaries and cuts of convex polytopes, Mathematika27 (1980), 58–63.

    MATH  MathSciNet  Google Scholar 

  11. E. R. Lockeberg,Refinements in boundary complexes of polytopes, Ph.D. thesis, University College, London, 1977.

    Google Scholar 

  12. P. McMullen and G. C. Shephard,Convex Polytopes and the Upper Bound Conjecture, London Math. Soc. Lecture Note Series 3, Cambridge University Press, 1971.

  13. I. Shemer,Neighborly polytopes, M.Sc. thesis, 1971 (in Hebrew).

  14. I. Shemer,Neighborly polytopes, Isr. J. Math.43 (1982), 291–314.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. C. Shephard,Sections and projections of convex polytopes, Mathematika19 (1972), 144–162.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altshuler, A., Shemer, I. Construction theorems for polytopes. Israel J. Math. 47, 99–110 (1984). https://doi.org/10.1007/BF02760509

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation