Polygons as sections of higher-dimensional polytopes

preprint2015arXivOpen access

Abstract

We show that every heptagon is a section of a 33-polytope with 66 vertices. This implies that every nn-gon with n≥7n\geq 7 can be obtained as a section of a (2+⌊n7⌋)(2+\lfloor\frac{n}{7}\rfloor)-dimensional polytope with at most ⌈6n7⌉\lceil\frac{6n}{7}\rceil vertices; and provides a geometric proof of the fact that every nonnegative n×mn\times m matrix of rank 33 has nonnegative rank not larger than ⌈6min⁡(n,m)7⌉\lceil\frac{6\min(n,m)}{7}\rceil. This result has been independently proved, algebraically, by Shitov (J. Combin. Theory Ser. A 122, 2014).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.