From acute sets to centrally symmetric $2$-neighborly polytopes
Combinatorics
2017-12-29 v1
Abstract
What is the maximum number of vertices that a centrally symmetric 2-neighborly polytope of dimension can have? It is known that the answer does not exceed . Here we provide an explicit construction showing that it is at least .
Keywords
Cite
@article{arxiv.1712.09489,
title = {From acute sets to centrally symmetric $2$-neighborly polytopes},
author = {Isabella Novik},
journal= {arXiv preprint arXiv:1712.09489},
year = {2017}
}