Related papers: A note on Bourgain's slicing problem

For $n\in \mathbb{N}$ let $S_n$ be the smallest number $S>0$ satisfying the inequality $$ \int_K f \le S \cdot |K|^{\frac 1n} \cdot \max_{\xi\in S^{n-1}} \int_{K\cap \xi^\bot} f $$ for all centrally-symmetric convex bodies $K$ in…

We provide the final step in the resolution of Bourgain's slicing problem in the affirmative. Thus we establish the following theorem: for any convex body $K \subseteq \mathbb{R}^n$ of volume one, there exists a hyperplane $H \subseteq…

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

We prove that the Bourgain slicing conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture in $\mathbb{R}^n$ hold true up to a factor of $\sqrt{\log n}$. A new ingredient used in the proof is an improved log-concave…

In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…

We prove that Bourgain's hyperplane conjecture and the Kannan-Lov\'asz-Simonovits (KLS) isoperimetric conjecture hold true up to a factor that is polylogarithmic in the dimension.

For every $n\geq 2$, Bourgain's constant $b_n$ is the largest number such that the (upper) Hausdorff dimension of harmonic measure is at most $n-b_n$ for every domain in $\mathbb{R}^n$ on which harmonic measure is defined. Jones and Wolff…

The purpose of this article is to describe a reduction of the slicing problem to the study of the parameter I_1(K,Z_q^o(K))=\int_K ||< :, x> ||_{L_q(K)}dx. We show that an upper bound of the form I_1(K,Z_q^o(K))\leq C_1q^s\sqrt{n}L_K^2,…

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

Bourgain's slicing conjecture was recently resolved by Joseph Lehec and Bo'az Klartag. We present an alternative proof by establishing small ball probability estimates for isotropic log-concave measures. Our approach relies on the…

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

We show that almost all natural numbers n not divisible by 4, and not congruent to 7 modulo 8, are represented as the sum of three squares, one of which is the square of an integer no larger than (log n)^{1+e} (any e>0). This answers a…

We prove that any subset $A \subseteq [3]^n$ with $3^{-n}|A| \ge (\log\log\log\log n)^{-c}$ contains a combinatorial line of length $3$, i.e., $x, y, z \in A$, not all equal, with $x_i=y_i=z_i$ or $(x_i,y_i,z_i)=(0,1,2)$ for all $i = 1, 2,…

Here we show that any n-dimensional centrally symmetric convex body K has an n-dimensional perturbation T which is convex and centrally symmetric, such that the isotropic constant of T is universally bounded. T is close to K in the sense…

For any origin-symmetric convex body $K$ in $\mathbb{R}^n$ in isotropic position, we obtain the bound: \[ M^*(K) \leq C \sqrt{n} \log(n)^2 L_K ~, \] where $M^*(K)$ denotes (half) the mean-width of $K$, $L_K$ is the isotropic constant of…

These are lecture notes focusing on recent progress towards Bourgain's slicing problem and the isoperimetric conjecture proposed by Kannan, Lovasz and Simonovits (KLS).

Fix $p>2$. We prove that the Euclidean distortion of every $n$-point subset of $L_p$ is $p^3(\log n)^{\frac12+o(1)}$, thus, in particular, demonstrating that all $n$-point subsets of $L_p$ exhibit an asymptotic improvement over the $O(\log…

Linial's seminal result shows that any deterministic distributed algorithm that finds a $3$-colouring of an $n$-cycle requires at least $\log^*(n)/2 - 1$ communication rounds. We give a new simpler proof of this theorem.

Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously best algorithm solves the problem in…

We prove that for some universal $c$, a non-collinear set of $N>\frac{1}{c}$ points in the Euclidean plane determines at least $c \frac{N}{\log N}$ distinct areas of triangles with one vertex at the origin, as well as at least $c…