Related papers: The width-volume inequality
Let M be a complete non-compact connected Riemannian n-dimensional manifold. We first prove that, for any fixed point p in M, the radial Ricci curvature of M at p is bounded from below by the radial curvature function of some non-compact…
We find an optimal upper bound on the volume of the John ellipsoid of a $k$-dimensional section of the $n$-dimensional cube, and an optimal lower bound on the volume of the L\"owner ellipsoid of a projection of the $n$-dimensional…
The Euclidean concentration inequality states that, among sets with fixed volume, balls have $r$-neighborhoods of minimal volume for every $r>0$. On an arbitrary set, the deviation of this volume growth from that of a ball is shown to…
The Mahler volume of a centrally symmetric convex body K is defined as M(K)= (Vol K)(Vol K^dual). Mahler conjectured that this volume is minimized when K is a cube. We introduce the bottleneck conjecture, which stipulates that a certain…
We give near-tight lower bounds for the sparsity required in several dimensionality reducing linear maps. First, consider the JL lemma which states that for any set of n vectors in R there is a matrix A in R^{m x d} with m = O(eps^{-2}log…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…
We investigate the dependence on the dimension in the inequalities that relate the Euclidean volume of a closed submanifold $M^n\subset \mathbb{R}^N$ with its $l^\infty$-width $W^{l^\infty}_{n-1}(M^n)$ defined as the infimum over all…
The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in…
We study algorithmic problems on subsets of Euclidean space of low fractal dimension. These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory. There are several…
We give asymptotic large deviations estimates for the volume inside a domain U of the zero set of a random polynomial of degree N, or more generally, of a holomorphic section of the N-th power of a positive line bundle on a compact Kaehler…
For every large enough $n$, we explicitly construct a body of constant width $2$ that has volume less than $0.9^n \text{Vol}(\mathbb{B}^{n}$), where $\mathbb{B}^{n}$ is the unit ball in $\mathbb{R}^{n}$. This answers a question of…
Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…
In this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…
A Riemannian n-manifold M has k-dimensional Uryson width bounded by a constant c >0 if there exists a continuous map f from M to an k-dimensional polyhedral space P, such that the pullbacks f^{-1}(p) of all points p in P have diameters…
A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in $\mathbb{R}^n$ was studied extensively for the last 70 years. In this paper, we…
We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…
In the Euclidean $k$-center problem in sliding window model, input points are given in a data stream and the goal is to find the $k$ smallest congruent balls whose union covers the $N$ most recent points of the stream. In this model, input…
Erd\H{o}s, Pach, Pollack, and Tuza [\textit{J. Combin. Theory Ser. B, 47(1) (1989), 73-79}] proved that the diameter of a connected $n$-vertex graph with minimum degree $\delta$ is at most $\frac{3n}{\delta+1}+O(1)$. The oriented diameter…