Preprint in the OpenAI Math release
A sharp entropy bound and the simplex inequality for isotropic constants
OpenAI
Abstract
We prove the strong isotropic constant conjecture: in each dimension, simplices are the unique maximizers of the isotropic constant among convex bodies. We also prove the sharp entropy bound for every log-concave probability density on ℝ, with equality precisely for invertible affine images of products of one-sided exponential laws.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.