How neighborly can a centrally symmetric polytope be?

Nathan Linial*, Isabella Novik

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


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.

Original languageAmerican English
Pages (from-to)273-281
Number of pages9
JournalDiscrete and Computational Geometry
Issue number2
StatePublished - Sep 2006


Dive into the research topics of 'How neighborly can a centrally symmetric polytope be?'. Together they form a unique fingerprint.

Cite this