From acute sets to centrally symmetric 2-neighborly polytopes

From MaRDI portal
Publication:3174697




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 2d. Here we provide an explicit construction showing that it is at least 2d1+2.









This page was built for publication: From acute sets to centrally symmetric 2-neighborly polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174697)