Entropy and the hyperplane conjecture in convex geometry

The hyperplane conjecture is a major unsolved problem in high-dimensional convex geometry that has attracted much attention in the geometric and functional analysis literature. It asserts that there exists a universal constant c such that for any convex set K of unit volume in any dimension, there exists a hyperplane H passing through its centroid such that the volume of the section K ∩ H is bounded below by c. A new formulation of this conjecture is given in purely information-theoretic terms. Specifically, the hyperplane conjecture is shown to be equivalent to the assertion that all log-concave probability measures are at most a bounded distance away from Gaussianity, where distance is measured by relative entropy per coordinate. It is also shown that the entropy per coordinate in a log-concave random vector of any dimension with given density at the mode has a range of just 1. Applications, such as a novel reverse entropy power inequality, are mentioned.