How neighborly can a centrally symmetric polytope be?

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-575453

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.