Related papers: Nonlinear Dimension Reduction via Outer Bi-Lipschi…

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

We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $\epsilon\geq d^{-O(1)}$, there is a random…

Johnson-Lindenstrauss embeddings are widely used to reduce the dimension and thus the processing time of data. To reduce the total complexity, also fast algorithms for applying these embeddings are necessary. To date, such fast algorithms…

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

We prove that the regular $n\times n$ square grid of points in the integer lattice $\mathbb{Z}^{2}$ cannot be recovered from an arbitrary $n^{2}$-element subset of $\mathbb{Z}^{2}$ via a mapping with prescribed Lipschitz constant…

A well-known theorem of Assouad states that metric spaces satisfying the doubling property can be snowflaked and bi-Lipschitz embedded into Euclidean spaces. Due to the invariance of many geometric properties under bi-Lipschitz maps, this…

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

The paper concerns multiobjective linear optimization problems in R^n that are parameterized with respect to the right-hand side perturbations of inequality constraints. Our focus is on measuring the variation of the feasible set and the…

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

In the nonlinear geometry of Banach spaces where the objects in the category are Banach spaces as in the linear case, the morphisms in the new setting are taken to comprise of certain nonlinear maps involving say, Lipschitz maps and, in…

This is one of a series of papers examining the interplay between differentiation theory for Lipschitz maps, X-->V, and bi-Lipschitz nonembeddability, where X is a metric measure space and V is a Banach space. Here, we consider the case…

Given a metric space (X, d), we continue our study of the distance function x\mapsto d(x,-) and its relation to bi-Lipschitz embeddings of (X, d) into R^N. As application, given a compact metric-measure space (X, d,\mu), we give three…

Let $\mathsf{S}_1$ (the Schatten--von Neumann trace class) denote the Banach space of all compact linear operators $T:\ell_2\to \ell_2$ whose nuclear norm $\|T\|_{\mathsf{S}_1}=\sum_{j=1}^\infty\sigma_j(T)$ is finite, where…

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

A recognized trend of research investigates generalizations of the Hadamard's inversion theorem to functions that may fail to be differentiable. In this vein, the present paper explores some consequences of a recent result about the…

We show that for any Carnot group $G$ there exists a natural number $D_G$ such that for any $0<\varepsilon<1/2$ the metric space $(G,d_G^{1-\varepsilon})$ admits a bi-Lipschitz embedding into $\mathbb{R}^{D_G}$ with distortion…

The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London…

The Erd\H{o}s similarity conjecture asserted that an infinite set of real numbers cannot be affinely embedded into every measurable set of positive Lebesgue measure. The problem is still open, in particular for all fast decaying sequences.…

We show an analog to the Fast Johnson-Lindenstrauss Transform for Nearest Neighbor Preserving Embeddings in $\ell_2$. These are sparse, randomized embeddings that preserve the (approximate) nearest neighbors. The dimensionality of the…

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz…