Metraipolis › archive › dc_a3ca22ec4537
Bourgain's Theorem for a Union of Euclidean Metric Spaces — arXiv:2611.08546
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08546
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:47:07.796Z
- SHA-256 of the archived text
d108d78c38f7e374d6b69f639adbf0865b661abd3f28124cc11945dc4795d8f7- Stable URL of this page
https://metraipolis.com/documento/dc_a3ca22ec4537
How to cite
Bourgain's Theorem for a Union of Euclidean Metric Spaces — arXiv:2611.08546 — arXiv (en), https://arxiv.org/abs/2611.08546 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a3ca22ec4537 (Metraipolis archive dc_a3ca22ec4537, sha256 d108d78c38f7e374d6b69f639adbf0865b661abd3f28124cc11945dc4795d8f7)
BibTeX
@misc{dca3ca22ec4537,
title = {Bourgain's Theorem for a Union of Euclidean Metric Spaces — arXiv:2611.08546},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08546},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a3ca22ec4537; sha256 d108d78c38f7e374d6b69f639adbf0865b661abd3f28124cc11945dc4795d8f7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08546. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the distortion of embedding a union of $k$ Euclidean sets into Euclidean space. We show that a union of $k$ Euclidean sets can be embedded with distortion at most $O(k^{1.128} \log k)$, independent of the number of points. This is an exponential improvement over the previous best known upper bound of $2^{O(k)}$ obtained by iterating the result of Makarychev and Makarychev (2016) for the special case $k = 2$. Surprisingly, with the additional assumption that each Euclidean set remains Euclidean when we adjoin any other two points, we can obtain an asymptotically tight distortion of $O(\log k)$, thus, providing a generalization of Bourgain's Theorem (1985). Along the way, we also show that the distortion of the union can be upper bounded by $O(\log k)$ times the maximum of the Lipschitz extension constants of individual Euclidean sets.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Geometry (cs.CG); Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2611.08546 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:40:29.862Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).