Prodsimplicial-Neighborly Polytopes

Details Prodsimplicial-Neighborly Polytopes Prodsimplicial-Neighborly Polytopes

2009-08-28

arxiv.org/abs/0908.4177v2

Discrete Comput. Geom., 46(1):100-131, 2011

Mathematics

Metric Geometry

28 pages, 9 figures; minor corrections

Scientific paper

Simultaneously generalizing both neighborly and neighborly cubical polytopes, we introduce PSN polytopes: their k-skeleton is combinatorially equivalent to that of a product of r simplices. We construct PSN polytopes by three different methods, the most versatile of which is an extension of Sanyal and Ziegler's "projecting deformed products" construction to products of arbitrary simple polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1. Using topological obstructions similar to those introduced by Sanyal to bound the number of vertices of Minkowski sums, we show that this dimension is minimal if we additionally require that the PSN polytope is obtained as a projection of a polytope that is combinatorially equivalent to the product of r simplices, when the dimensions of these simplices are all large compared to k.

Affiliated with

Also associated with

No associations

Rating

Prodsimplicial-Neighborly Polytopes 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 Prodsimplicial-Neighborly Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prodsimplicial-Neighborly Polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193444