On the discrete logarithmic Minkowski problem in the plane
Abstract
The paper characterizes the convex hull of the closure of the cone-volume set C(U), consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in U, for any finite set U ⊂eq 2, (U) = 2. We prove that this convex hull has finitely many extreme points by providing both a vertex representation as well as a half space representation. As a consequence, we derive new necessary conditions, which depend on U, for the existence of solutions to the logarithmic Minkowski problem in 2.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.