On polynomial inequalities for cone-volumes of polytopes
Abstract
Motivated by the discrete logarithmic Minkowski problem we study for a given matrix U∈Rn× m its cone-volume set C cv(U) consisting of all the cone-volume vectors of polytopes P(U,b)=\ x∈Rn : U∫ercal x≤ b\, b∈Rn≥ 0. We will show that C cv(U) is a path-connected semialgebraic set which extends former results in the planar case or for particular polytopes. Moreover, we define a subspace concentration polytope P scc(U) which represents geometrically the subspace concentration conditions for a finite discrete Borel measure on the sphere. This is up to a scaling the basis matroid polytope of U, and these two sets, P scc(U) and C cv(U), also offer a new geometric point of view to the discrete logarithmic Minkowski problem.
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.