How neighborly can a centrally symmetric polytope be?
Combinatorics
2007-05-23 v1
Abstract
We show that there exist k-neighborly centrally symmetric d-dimensional polytopes with 2(n+d) vertices, where k(d,n)=Theta(d/(1+log ((d+n)/d))). We also show that this bound is tight.
Keywords
Cite
@article{arxiv.math/0507280,
title = {How neighborly can a centrally symmetric polytope be?},
author = {Nathan Linial and Isabella Novik},
journal= {arXiv preprint arXiv:math/0507280},
year = {2007}
}
Comments
7 pages