paper

Metric embeddings of cubes into dense subsets of cubes

arXiv:2603.04644

Abstract

Fix . We study how large must be so that every -dense subset (meaning ) contains the image of a metric embedding . We study variants: For a -bi-Lipschitz map for a fixed , we show that . For an isometric map with arbitrary rescaling (i.e. undistorted), we show that . For an isometric map with bounded rescaling we show that . Regarding the path space, we prove the density analog of a coloring theorem of Rödl--Sales. We give bounds for -bi-Lipschitz embeddings of the path into dense subsets of the path , 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 that embeds with bi-Lipschitz distortion into a metric space of non-negative Alexandrov curvature must be small, namely, necessarily . We prove that for every , any that embeds with distortion into some metric space of non-positive Alexandrov curvature must satisfy 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.

32 pages