A sharp isoperimetric bound for convex bodies

We consider the problem of lower bounding the Minkowski content of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp for all set sizes, dimensions, and norms. In the case of uniform density a stronger theorem is shown which is also sharp. Supported in part by VIGRE grants at Yale University and the Georgia Institute of Technology.