The Kannan-Lovász-Simonovits Conjecture

07/10/2018
by   Yin Tat Lee, et al.
0

The Kannan-Lovász-Simonovits conjecture says that the Cheeger constant of any logconcave density is achieved to within a universal, dimension-independent constant factor by a hyperplane-induced subset. Here we survey the origin and consequences of the conjecture (in geometry, probability, information theory and algorithms) as well as recent progress resulting in the current best bounds. The conjecture has lead to several techniques of general interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2021

Compact Packings are not always the Densest

We provide a counterexample to a conjecture by B. Connelly about density...
research
11/29/2020

On the Nisan-Ronen conjecture

The Nisan-Ronen conjecture states that no truthful mechanism for makespa...
research
10/23/2022

Entropic exercises around the Kneser-Poulsen conjecture

We develop an information-theoretic approach to study the Kneser–Poulsen...
research
12/20/2017

Can one design a geometry engine? On the (un)decidability of affine Euclidean geometries

We survey the status of decidabilty of the consequence relation in vario...
research
12/02/2022

Quantitative bounds for unconditional pairs of frames

We formulate a quantitative finite-dimensional conjecture about frame mu...
research
11/19/2021

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

We refute the Probabilistic Universal Graph Conjecture of Harms, Wild, a...
research
12/21/2022

A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points

We prove that for c>0 a sufficiently small universal constant that a ran...

Please sign up or login with your details

Forgot password? Click here to reset