How neighborly can a centrally symmetric polytope be?
classification
🧮 math.CO
keywords
centrallysymmetricboundd-dimensionalexistk-neighborlyneighborlypolytope
read the original abstract
We show that there exist k-neighborly centrally symmetric d-dimensional polytopes with 2(n+d) vertices, where k(d,n)=Theta(d/(1+log ((d+n)/d))). We also show that this bound is tight.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.