The K L S Conjecture for a Convex Shape

The k l s conjecture asks if a high dimensional convex shape can contain a hidden, twisty sort of dumb bell that slows down random mixing. Eldan was able to calculate a kl s bound for the original shape. And in two thousand 12, eldan lowered their bound to the cube root of the dimension by introducing a technique called stacastic localization.