From acute sets to centrally symmetric 2-neighborly polytopes

From MaRDI portal
Publication:3174697

DOI10.1137/18M1164202zbMATH Open1395.52015arXiv1712.09489OpenAlexW2963366168MaRDI QIDQ3174697FDOQ3174697

Isabella Novik

Publication date: 18 July 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1712.09489




Recommendations




Cites Work


Cited In (5)





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)