NewEvery arXiv paper, its researchers & institutions — mapped.
paper

How neighborly can a centrally symmetric polytope be?

arXiv:math/0507280

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.

7 pages