How neighborly can a centrally symmetric polytope be?

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 52B05; 52B15; 52B35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/75777

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0507280
 http://arxiv.org/abs/math/0507280

Collections

arXiv