The non-neighbourliness of centrally symmetric convex polytopes having many vertices
From MaRDI portal
The author proves that an O-symmetric convex \(d\)-polytope, \(d\geq 2\) is not neighbourly, if it has more than \(N(d)\) vertices. Here \(N(d)\) is the maximum number of points on the unit-sphere \(S^{d-1}\) whose distance apart is \(\geq 2d^{-1/2}\).
Recommendations
- How neighborly can a centrally symmetric polytope be?
- From acute sets to centrally symmetric 2-neighborly polytopes
- Arbitrarily large neighborly families of symmetric convex polytopes
- Centrally symmetric polytopes with many faces
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets
Cites work
Cited in
(9)- Remarks on the upper bound theorem.
- On face numbers of manifolds with symmetry
- An infinite family of nearly neighborly centrally symmetric 3-spheres
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets
- Ear decomposition and balanced neighborly simplicial manifolds
- How neighborly can a centrally symmetric polytope be?
- From acute sets to centrally symmetric 2-neighborly polytopes
- The extremal spheres theorem
- Face numbers: the upper bound side of the story
This page was built for publication: The non-neighbourliness of centrally symmetric convex polytopes having many vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180562)
