Vertex generated polytopes
Shiri Artstein-Avidan, Tomer Falah, Boaz A. Slomka

TL;DR
This paper introduces the class of vertex generated polytopes, explores their properties, and demonstrates their density in two dimensions, along with applications to polytope approximation and covering properties.
Contribution
It defines vertex generated polytopes, proves their inclusion of zonotopes, density in 2D, and establishes approximation and covering results related to this class.
Findings
All zonotopes are vertex generated.
Vertex generated polytopes are dense in 2D.
Any polytope can be summed with a zonotope to become vertex generated.
Abstract
In this paper we define and investigate a class of polytopes which we call "vertex generated" consisting of polytopes which are the average of their and dimensional faces. We show many results regarding this class, among them: that the class contains all zonotopes, that it is dense in dimension , that any polytope can be summed with a zonotope so that the sum is in this class, and that a strong form of the celebrated "Maurey Lemma" holds for polytopes in this class. We introduce for every polytope a parameter which measures how far it is from being vertex-generated, and show that when this parameter is small, strong covering properties hold.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Genome Rearrangement Algorithms · semigroups and automata theory
