From acute sets to centrally symmetric $2$-neighborly polytopes

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$.