How neighborly can a centrally symmetric polytope be?
Nathan LinialIsabella Novik
所有作者
Nathan LinialIsabella Novik
文献摘要
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.