How neighborly can a centrally symmetric polytope be?

Simple item page
dc.creatorLinial, Nathan
dc.creatorNovik, Isabella
dc.date2005-07-14
dc.date.accessioned2026-07-07T05:21:41Z
dc.date.available2026-07-07T05:21:41Z
dc.descriptionWe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/math/0507280
dc.identifierhttp://arxiv.org/abs/math/0507280
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75777
dc.subjectCombinatorics
dc.subject52B05; 52B15; 52B35
dc.titleHow neighborly can a centrally symmetric polytope be?
dc.typetext

Files

Collections

arXiv