Related papers: Optimal Bounds for Johnson-Lindenstrauss Transform…

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.…

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

In this paper, we prove an upper bound on the second non-zero Laplacian eigenvalue on $n$-dimensional real projective space. The sharp result for 2-dimensions was shown by Nadirashvili and Penskoi and later by Karpukhin when the metric…

Suppose that two large, multi-dimensional data sets are each noisy measurements of the same underlying random process, and principle components analysis is performed separately on the data sets to reduce their dimensionality. In some…

This reply shows that the argument presented in the comment by Jorg and Krzakala (cond mat 0709.0894) cannot be used to weaken the results presented in our paper on ultrametricity evidence in the 3d Edwards Anderson model (PRL 99, 057206,…

In 1996, Meshulam proved that every sequence generated by applying projections onto affine subspaces, drawn from a finite collection in Euclidean space, must be bounded. In this paper, we extend his result not only from affine subspaces to…

Eggleston (1957) proved that in the Euclidean plane the best approximating convex $n$-gon to a convex disc $K$ is always inscribed in $K$ if we measure the distance by perimeter deviation. We prove that the analogue of Eggleston's statement…

Recently, the first author together with Jens Marklof studied generalizations of the classical three distance theorem to higher dimensional toral rotations, giving upper bounds in all dimensions for the corresponding numbers of distances…

We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…

We investigate lower asymptotic bounds of number variances for invariant locally square-integrable random measures on Euclidean and real hyperbolic spaces. In the Euclidean case we show that there are subsequences of radii for which the…

For a given metric measure space $(X,d,\mu)$ we consider finite samples of points, calculate the matrix of distances between them and then reconstruct the points in some finite-dimensional space using the multidimensional scaling (MDS)…

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

The Johnson--Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be flattened to lower dimensions while…

A classical theorem of Alon and Milman states that any $d$ dimensional centrally symmetric convex body has a projection of dimension $m\geq e^{c\sqrt{\ln{d}}}$ which is either close to the $m$-dimensional Euclidean ball or to the…

We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large''…

The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

In many robotics applications, it is necessary to compute not only the distance between the robot and the environment, but also its derivative - for example, when using control barrier functions. However, since the traditional Euclidean…

We introduce and study finite $d$-volumes - the high dimensional generalization of finite metric spaces. Having developed a suitable combinatorial machinery, we define $\ell_1$-volumes and show that they contain Euclidean volumes and…