Inequalities on Projected Volumes
Imre Leader, \v{Z}arko Ran{\dj}elovi\'c, Eero R\"aty

TL;DR
This paper investigates geometric inequalities related to the volumes of projections of bodies in n-dimensional space, proving a near-complete characterization of feasible volume log-values and disproving a longstanding conjecture about their convex hull.
Contribution
It proves that the closed convex hull of the set of feasible projection volume logs equals the cone defined by uniform cover inequalities, but the convex hull itself is not closed for four or more dimensions.
Findings
The closed convex hull of feasible volume logs matches the uniform cover inequalities cone.
The convex hull of feasible volume logs is not closed for n ≥ 4.
The conjecture that the convex hull equals the uniform cover inequalities cone is disproved.
Abstract
In this paper we study the following geometric problem: given real numbers indexed by the non-empty subsets , is it possible to construct a body such that where is the -dimensional volume of the projection of onto the subspace spanned by the axes in ? As it is more convenient to take logarithms we denote by the set of all vectors for which there is a body such that for all . Bollob\'as and Thomason showed that is contained in the polyhedral cone defined by the class of `uniform cover inequalities'. Tan and Zeng conjectured that the convex hull is equal to the cone given by the uniform cover inequalities. We prove that this conjecture is `nearly' right: the closed convex hull…
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.
