Academic
Publications
How Neighborly Can a Centrally Symmetric Polytope Be?

How Neighborly Can a Centrally Symmetric Polytope Be?,10.1007/s00454-006-1235-1,Discrete & Computational Geometry,Nathan Linial,Isabella Novik

How Neighborly Can a Centrally Symmetric Polytope Be?   (Citations: 21)
BibTex | RIS | RefWorks Download
We show that there exist k-neighborly centrally symmetric d- dimensional polytopes with 2(n + d) vertices, where k(d,n) = " d 1 + log((d + n)/d) « . We also show that this bound is tight.
Journal: Discrete & Computational Geometry - DCG , vol. 36, no. 2, pp. 273-281, 2006
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: