Simplicial neighbourly 5-polytopes with nine vertices

DOI10.1007/s40590-014-0013-yzbMath1432.52016OpenAlexW2073464242MaRDI QIDQ2343196

Wendy A. Finbow

Publication date: 4 May 2015

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40590-014-0013-y

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items

Enumerating Neighborly Polytopes and Oriented Matroids, Realizability and inscribability for simplicial polytopes via nonlinear optimization, Simplicial neighbourly 5-polytopes with nine vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighborly 6-polytopes with 10 vertices
• Separation in semi-cyclic 4-polytopes
• A generalized sewing construction for polytopes
• Enumeration of the quasisimplicial 3-spheres and 4-polytopes with eight vertices
• How many cyclic subpolytopes can a non-cyclic polytope have?
• Neighborly polytopes
• A proof of Hadwiger's covering conjecture for dual cyclic polytopes
• Nonconvex embeddings of the exceptional simplicial 3-spheres with 8 vertices
• Simplicial neighbourly 5-polytopes with nine vertices
• The problem of illumination of the boundary of a convex body by affine subspaces
• The number of simplicial neighbourly d ‐polytopes with d +3 vertices
• An enumeration of simplicial 4-polytopes with 8 vertices
• The maximum numbers of faces of a convex polytope