加载中…
The Kannan–Lovász–Simonovits (KLS) conjecture asks whether every isotropic log-concave probability measure on has a Cheeger constant bounded below by a universal positive constant. The best previous upper bound is , due to Letwin [Let26]. We prove that for a universal constant , where is the least number of successive natural logarithms needed to bring to at most one. We also prove that for every isotropic log-concave probability measure on , with a universal constant .

生成讲解博客的中文版本

生成AI智能校验的中文版本