How neighborly can a centrally symmetric polytope be?

Nathan Linial; Isabella Novik

doi:10.1007/s00454-006-1235-1

How neighborly can a centrally symmetric polytope be?

Nathan Linial^*
, Isabella Novik

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

Abstract

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 language	English
Pages (from-to)	273-281
Number of pages	9
Journal	Discrete and Computational Geometry
Volume	36
Issue number	2
DOIs	https://doi.org/10.1007/s00454-006-1235-1
State	Published - Sep 2006

Access to Document

10.1007/s00454-006-1235-1

Cite this

@article{d15206b8e396495e886da4f0a50c275f,

title = "How neighborly can a centrally symmetric polytope be?",

abstract = "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.",

author = "Nathan Linial and Isabella Novik",

year = "2006",

month = sep,

doi = "10.1007/s00454-006-1235-1",

language = "אנגלית",

volume = "36",

pages = "273--281",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",