Abstract
We show that there are exactly 126 combinatorially distinct simplicial, neighbourly 5-polytopes with nine vertices, and give their constructions.
Similar content being viewed by others
References
Altshuler, A., McMullen, P.: The number of simplicial neighbourly \(d\)-polytopes with \(d+3\) vertices. Mathematika 20, 263–266 (1973)
Altshuler, A., Steinberg, L.: Enumeration of the quasisimplicial 3-spheres and 4-polytopes with eight vertices. Pac. J. Math. 113, 269–288 (1984)
Barnette, D.: Diagrams and Schlegel diagrams. In: Combinatorial Structures and Their Applications. Proceedings of the Calgary International Conference, Calgary, Alta. Gordon and Breach, New York, pp. 1–4 (1970)
Bezdek, K.: The problem of illumination of a convex body by affine subspaces. Mathematika 38, 362–375 (1991)
Bezdek, K., Bisztriczky, T.: A proof of Hadwiger’s covering conjecture for dual cyclic polytopes. Geom. Dedic. 68, 29–41 (1997)
Bokowski, J., Shemer, I.: Neighborly 6-polytopes with 10 vertices. Isr. J. Math. 58, 103–124 (1987)
Brøndsted, A.: An Introduction to Convex Polytopes. Springer-Verlag, New York (1983)
Brückner, M.: Die Elemente der vierdimensionalen Geometrie mit besonderer Berücksichtigung der Polytope. Jber. Ver. Naturk. Zwickau, p. 1173 (1893)
Finbow, W.: A list of the simplicial neighbourly 5-polytopes with nine vertices. In: SMU Math/CS Technical Report 2010-001. http://www.cs.smu.ca/tech_reports (2010). Accessed 11 June 2010
Finbow, W.: An enumeration of the combinatorial simplicial neighbourly 5-polytopes with nine vertices. In: SMU Math/CS Technical Report 2014=001. http://www.cs.smu.ca/tech_reports (2014, to appear). Accessed 11 June 2010
Finbow, W.: Low Dimensional Neighbourly Polytopes. PhD thesis, University of Calgary, Canada (2004)
Finbow, W.: Low dimensional simplicial neighbourly \(d\)-polytopes with \(d+4\) vertices (2014, to appear)
Finbow, W., Oliveros, D.: Separation in semi-cyclic 4-polytopes. Bol. Soc. Mat. Mex. 8, 63–74 (2002)
Grünbaum, B.: Convex Polytopes. Interscience, London (1967)
Grünbaum, B., Sreedharan, V.P.: An enumeration of simplicial 4-polytopes with 8 vertices. J. Comb. Theory 2, 437–465 (1967)
Lee, C., Menzel, M.: A generalized sewing construction for polytopes. Isr. J. Math. 126, 241–267 (2010)
McKay, B.D.: Practical graph isomorphism. Congr. Numer. 30, 45–87 (1981)
McMullen, P.: The maximum number of faces of a convex polytope. Mathematika 17, 179–184 (1970)
Milhalisin, J., Williams, G.: Nonconvex embeddings of the exceptional simplicial 3-spheres. J. Comb. Theory Ser. A. 98, 74–86 (2002)
Shemer, I.: Neighbourly polytopes. Isr. J. Math. 43, 291–314 (1982)
Shemer, I.: How many cyclic subpolytopes can a non-cyclic polytope have? Isr. J. Math. 49, 331–342 (1984)
Author information
Authors and Affiliations
Corresponding author
Additional information
W. Finbow wishes to thank the anonymous referees for their many helpful suggestions.
W. Finbow was supported by a grant from NSERC.
Rights and permissions
About this article
Cite this article
Finbow, W. Simplicial neighbourly 5-polytopes with nine vertices. Bol. Soc. Mat. Mex. 21, 39–51 (2015). https://doi.org/10.1007/s40590-014-0013-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40590-014-0013-y