2000 character limit reached
On Godbersen's Conjecture (1408.2135v1)
Published 9 Aug 2014 in math.MG
Abstract: We provide a natural generalization of a geometric conjecture of F\'{a}ry and R\'{e}dei regarding the volume of the convex hull of $K \subset {\mathbb R}n$, and its negative image $-K$. We show that it implies Godbersen's conjecture regarding the mixed volumes of the convex bodies $K$ and $-K$. We then use the same type of reasoning to produce the currently best known upper bound for the mixed volumes $V(K[j], -K[n-j])$, which is not far from Godbersen's conjectured bound. To this end we prove a certain functional inequality generalizing Colesanti's difference function inequality.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.