Indexed metadata

Polygons as Sections of Higher-Dimensional Polytopes

Arnau Padrol, Julian Pfeifle

Source record

Source: Crossref

Published: Feb 9, 2015

DOI: 10.37236/4315

Open original source ↗

Source abstract

We show that every heptagon is a section of a 33-polytope with 66 vertices. This implies that every nn-gon with n7n\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).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.