Mathematics – Combinatorics
Scientific paper
2005-07-14
Mathematics
Combinatorics
7 pages
Scientific paper
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.
Linial Nathan
Novik Isabella
No associations
LandOfFree
How neighborly can a centrally symmetric polytope be? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How neighborly can a centrally symmetric polytope be?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How neighborly can a centrally symmetric polytope be? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-575453