Related papers: Embedding the diamond graph in $L_p$ and dimension…

Let $K$ be a smooth, origin-symmetric, strictly convex body in $\mathbb{R}^n$. If for some $\ell\in GL(n,\mathbb{R})$, the anisotropic Riemannian metric $\frac{1}{2}D^2 \Vert\cdot\Vert_{\ell K}^2$, encapsulating the curvature of $\ell K$,…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

The seminal Fast Johnson-Lindenstrauss (Fast JL) transform by Ailon and Chazelle (SICOMP'09) embeds a set of $n$ points in $d$-dimensional Euclidean space into optimal $k=O(\varepsilon^{-2} \ln n)$ dimensions, while preserving all pairwise…

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…

For any metric space $X$, finite subset spaces of $X$ provide a sequence of isometric embeddings $X=X(1)\subset X(2)\subset\cdots$. The existence of Lipschitz retractions $r_n\colon X(n)\to X(n-1)$ depends on the geometry of $X$ in a subtle…

This paper studies the minimal dimension required to embed subset memberships ($m$ elements and ${m\choose k}$ subsets of at most $k$ elements) into vector spaces, denoted as Minimal Embeddable Dimension (MED). The tight bounds of MED are…

A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a graph in order to make the resulting graph have diameter D.…

An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without diamonds can be decomposed via clique-separators into graphs…

A well-known result by Lindenstrauss is that any two-dimensional normed space can be isometrically imbedded into $L_1(0,1)$. We provide an explicit form of a such an imbedding. The proof is elementary and self-contained. Applications are…

There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…

Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Known results easily imply polynomiality of EMBED(k,2) (k=1,2;…

Various new nonembeddability results (mainly into $L_1$) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on $\{0,1\}^d$ has $L_1$ distortion $(\log d)^{\frac12-o(1)}$. We also give new lower bounds on the…

A distortion lower bound of $\Omega(\log(h)^{1/p})$ is proven for embedding the complete countably branching hyperbolic tree of height $h$ into a Banach space admitting an equivalent norm satisfying property $(\beta)$ of Rolewicz with…

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…

Let G be an amenable group and V be a finite dimensional vector space. Gromov pointed out that the von Neumann dimension of linear subspaces of l^2(G;V) (with respect to G) can be obtained by looking at a growth factor for a dynamical…

In this article, we prove several results about the extension to the boundary of conformal immersions from an open subset $\Omega$ of a Riemannian manifold $L$, into another Riemannian manifold $N$ of the same dimension. In dimension $n…

We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanced with a roll-back idea allowing to sequentially retrace…

We prove that the vector space R^d of any finite dimension d with the standard metric embeds in a bi-Lipschitz way into the group of area-preserving diffeomorphisms G of the two-sphere endowed with the L^p-metric for p>2. Along the way we…

We report the observation and the theoretical explanation of the parametric down-conversion nonlinear susceptibility at the $K$-absorption edge of diamond and at the $L_{23}$-absorption edge of a silicon crystal. Using arguments similar to…

The dichromatic number $\vec\chi(D)$ of a digraph $D$ is the minimum size of a partition of its vertices into acyclic induced subgraphs. We denote by $\lambda(D)$ the maximum local edge connectivity of a digraph $D$. Neumann-Lara proved…