AI Chat AI Image Generator AI Video Text to Speech

A Slightly Improved Bound for the KLS Constant

08/24/2022

∙

by Arun Jambulapati, et al.

∙

∙

We refine the recent breakthrough technique of Klartag and Lehec to obtain an improved polylogarithmic bound for the KLS constant.

Arun Jambulapati
25 publications
Yin Tat Lee
64 publications
Santosh S. Vempala
31 publications

page 1

page 2

page 3

page 4

research

∙ 08/22/2019

Improved bounds for the sunflower lemma

A sunflower with r petals is a collection of r sets so that the intersec...

0 Ryan Alweiss, et al. ∙

research

∙ 04/23/2020

Diophantine problems related to the Omega constant

Some diophantine problems are stated for the Omega constant and, more ge...

0 Wadim Zudilin, et al. ∙

research

∙ 03/19/2019

A tighter bound on the number of relevant variables in a bounded degree Boolean function

A classical theorem of Nisan and Szegedy says that a boolean function wi...

0 Jake Wellens, et al. ∙

research

∙ 09/13/2021

On Shallow Packings and Tusnády's Problem

Tusnády's problem asks to bound the discrepancy of points and axis-paral...

0 Kunal Dutta, et al. ∙

research

∙ 10/31/2021

On The Absolute Constant in Hanson-Wright Inequality

We revisit and slightly modify the proof of the Gaussian Hanson-Wright i...

0 Kamyar Moshksar, et al. ∙

research

∙ 10/09/2020

Constant-time connectivity tests

We present implementations of constant-time algorithms for connectivity ...

0 Philipp Klaus Krause, et al. ∙

research

∙ 03/10/2018

Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors

We determine the probability, structure dependent, that the block Wiedem...

0 Gavin Harrison, et al. ∙