From acute sets to centrally symmetric 2-neighborly polytopes

2017/12/27 by Novik, Isabella
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1712.09489

Abstract

What is the maximum number of vertices that a centrally symmetric 2-neighborly polytope of dimension d can have? It is known that the answer does not exceed 2^d. Here we provide an explicit construction showing that it is at least 2^d-1+2.

Related

• How neighborly can a centrally symmetric polytope be?
• Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets
• An explicit construction for neighborly centrally symmetric polytopes
• A centrally symmetric version of the cyclic polytope
• A bound for the number of vertices of a polytope with applications