惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Microsoft Azure Blog
Microsoft Azure Blog
WordPress大学
WordPress大学
Google DeepMind News
Google DeepMind News
美团技术团队
大猫的无限游戏
大猫的无限游戏
H
Help Net Security
小众软件
小众软件
aimingoo的专栏
aimingoo的专栏
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
M
MIT News - Artificial intelligence
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - Franky
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Microsoft Security Blog
Microsoft Security Blog
F
Fortinet All Blogs
A
About on SuperTechFans
Recent Announcements
Recent Announcements
D
Docker
Vercel News
Vercel News
Engineering at Meta
Engineering at Meta
腾讯CDC
Martin Fowler
Martin Fowler
阮一峰的网络日志
阮一峰的网络日志

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Metric embeddings of cubes into dense subsets of cubes
[Submitted on 4 Mar 2026 (v1), last revised 1 Jul 2026 (this ver · 2026-03-05 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Fix $k \in \mathbb{N}, 0 < \delta < 1$. We study how large $N$ must be so that every $\delta$-dense subset $\mathcal{D} \subset \{0,1\}^N$ (meaning $|\mathcal{D}|\geq \delta 2^N$) contains the image of a metric embedding $f: \{0,1\}^k \to \mathcal{D}$. We study $3$ variants: For a $(1+\varepsilon)$-bi-Lipschitz map $f$ for a fixed $\varepsilon>0$, we show that $N = O(\varepsilon^{-2}\log(1/\delta) k^3)$. For an isometric map $f$ with arbitrary rescaling (i.e. undistorted), we show that $N = \log(1/\delta) e^{\Omega(k)}$. For an isometric map $f$ with bounded rescaling we show that $N = \exp{[\log(1/\delta)e^{\Theta(k)}]}$.
Regarding the path space, we prove the density analog of a coloring theorem of Rödl--Sales. We give bounds for $(1+\varepsilon)$-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 $\mathcal{D} \subset \{0,1\}^N$ that embeds with bi-Lipschitz distortion $<\alpha$ into a metric space of non-negative Alexandrov curvature must be small, namely, necessarily $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-2}))}$. We prove that for every $N\gtrsim \alpha^{6}\ge 1$, any $\mathcal{D} \subset \{0,1\}^N$ that embeds with distortion $<\alpha$ into some metric space of non-positive Alexandrov curvature must satisfy $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-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.

Submission history

From: Cosmas Kravaris [view email]
[v1] Wed, 4 Mar 2026 22:12:53 UTC (37 KB)
[v2] Wed, 1 Jul 2026 22:06:58 UTC (41 KB)