Henry Adams

collaborators

4 papers

math.MG2026

Tight upper bound on $d_{G H} (S^{1}, S^{2 k + 1})$ : GPT's short proof

Henry Adams

We describe GPT-5.6 Sol Pro's short proof that $2 \cdot d_{G H} (S^{1}, S^{2 k + 1}) \leq \frac{2 π k}{2 k + 1}$ . This is the odd-dimensional case of a tight upper bound by Harrison and Jeffs on…

math.MG2026

Gromov-Hausdorff distance and Jung constant of finite-dimensional normed spaces

Henry Adams, Semeon A. Bogatyi, Florian Frick +5

For a finite-dimensional normed space $V$ and a subset $X$ with finite Hausdorff distance from $V$ , we prove that the Gromov--Hausdorff distance between $X$ and $V$ is at least the…

math.MG2024

Lower Bounding the Gromov--Hausdorff distance in Metric Graphs

Henry Adams, Sushovan Majhi, Fedor Manin +2

Let $G$ be a finite, connected metric graph and let $X \subseteq G$ be a subset. If $X$ is sufficiently dense in $G$ , we show that the Gromov--Hausdorff distance matches the Hausdor…

math.MG2024

Gromov-Hausdorff distances between quotient metric spaces

Henry Adams, Armando Albornoz, Glenn Bruda +7

The Hausdorff distance measures how far apart two sets are in a common metric space. By contrast, the Gromov-Hausdorff distance provides a notion of distance between two abstract m…

Tight upper bound on dGH​(S1,S2k+1): GPT's short proof

Gromov-Hausdorff distance and Jung constant of finite-dimensional normed spaces

Lower Bounding the Gromov--Hausdorff distance in Metric Graphs

Gromov-Hausdorff distances between quotient metric spaces

Tight upper bound on $d_{G H} (S^{1}, S^{2 k + 1})$ : GPT's short proof