Metraipolis › archive › dc_822a2ea56b64

Cutting a convex body into fat parts and approximating Euclidean distance by graph distances — arXiv:2609.20702

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20702
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:29.390Z
SHA-256 of the archived text
41b897298200c5f8a3314afa2f7937a0bd182902de3e3a30ba7be5bd062a4252
Stable URL of this page
https://metraipolis.com/documento/dc_822a2ea56b64

How to cite

Cutting a convex body into fat parts and approximating Euclidean distance by graph distances — arXiv:2609.20702 — arXiv (en), https://arxiv.org/abs/2609.20702 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_822a2ea56b64 (Metraipolis archive dc_822a2ea56b64, sha256 41b897298200c5f8a3314afa2f7937a0bd182902de3e3a30ba7be5bd062a4252)
BibTeX
@misc{dc822a2ea56b64,
  title = {Cutting a convex body into fat parts and approximating Euclidean distance by graph distances — arXiv:2609.20702},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20702},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_822a2ea56b64; sha256 41b897298200c5f8a3314afa2f7937a0bd182902de3e3a30ba7be5bd062a4252},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20702. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Can one construct a graph $G$ on the set of integer points ${\mathbb Z}^2$ in the plane such that the length of the shortest path between any two vertices of $G$ differs from their Euclidean distance by at most an absolute constant? This question of Benjamini, Erd\H os, Kleiner, Kozma, Schramm, and the first-named author has been open for a long time. We give an affirmative answer to a weaker form of this question, based on the following geometric statement, which is of independent interest. There exists a constant $c>0$ such that for every $i=1,2,\ldots,$ every $\rho$-fat plane convex set $S$ can be cut into $2^i$ convex pieces of equal area, each of which is at least $c\rho$-fat. (A convex set is $\rho$-fat if the ratio of its inradius to its circumradius is at least $\rho$.) We prove that there exists an (unweighted) spanning subgraph $G$ of an enlarged copy of ${\mathbb Z}^2$ such that, for every pair of vertices at Euclidean distance $d$, their shortest-path distance in $G$ lies between $d-O(1)$ and $d+o(d^{5/6})$. The same bound can be achieved by a planar graph with vertex set ${\mathbb Z}^2$, in which every edge joins two vertices at Euclidean distance at most 2.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.20702 — 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-10-10T04:15:33.162Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).