Metric embeddings of cubes into dense subsets of cubes
Abstract
Fix k ∈ N, 0 < δ< 1. We study how large N must be so that every δ-dense subset D ⊂ \0,1\N (meaning |D|≥ δ2N) contains the image of a metric embedding f: \0,1\k D. We study 3 variants: For a (1+)-bi-Lipschitz map f for a fixed >0, we show that N = O(-2(1/δ) k3). For an isometric map f with arbitrary rescaling (i.e. undistorted), we show that N = (1/δ) eΩ(k). For an isometric map f with bounded rescaling we show that N = [(1/δ)eΘ(k)]. Regarding the path space, we prove the density analog of a coloring theorem of Rödl--Sales. We give bounds for (1+)-bi-Lipschitz embeddings of the path [k] = \1,...,k\ into dense subsets of the path [N] = \1,...,N\, improving a bound of Dumitrescu. We prove similar bounds for the binary tree space, using the tree replicas theorem of Pach--Solymosi--Tardos. As a geometric application we obtain a non-positive Alexandrov curvature counterpart to the work of Bartal--Linial--Mendel--Naor on the nonlinear Dvoretzky problem who showed that any D ⊂ \0,1\N that embeds with bi-Lipschitz distortion <α into a metric space of non-negative Alexandrov curvature must be small, namely, necessarily |D| 2N(1-Ω(α-2)). We prove that for every N α6 1, any D ⊂ \0,1\N that embeds with distortion <α into some metric space of non-positive Alexandrov curvature must satisfy |D| 2N(1-Ω(α-4)) via an approach which is entirely different from that of Bartal--Linial--Mendel--Naor. We also show that nontrivial metric type and non-universality are preserved by taking finite unions of subspaces.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.