How Neighborly Can a Centrally Symmetric Polytope Be?

13 years 4 months ago

Download www.math.washington.edu

Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = ,, d 1 + log((d + n)/d)

Nathan Linial, Isabella Novik

Real-time Traffic

DCG 2006 | Symmetric Ddimensional Polytopes |

claim paper

Related Content

» Zonotopes as bounding volumes

» Tracking and Activity Recognition Through Consensus in Distributed Camera Networks

» Integrating software distributed shared memory and message passing programming

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DCG
Authors	Nathan Linial, Isabella Novik

Comments (0)

Sciweavers

How Neighborly Can a Centrally Symmetric Polytope Be?

DCG 2006 | Symmetric Ddimensional Polytopes |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers