PreprintarXiv licencearXiv
Tight upper bound on dGH(S1,S2k+1): GPT's short proof
Abstract
We describe GPT-5.6 Sol Pro's short proof that 2· dGH(S1,S2k+1) ≤ 2πk/(2k+1). This is the odd-dimensional case of a tight upper bound by Harrison and Jeffs on the Gromov--Hausdorff distance between the circle and spheres.
Related
- The Tight Upper Bound on the Number of Distinct Squares in Circular Words
- An elementary proof of a tight Δ+1 bound for the additive chromatic number
- Another Brick in the Wall: A Computationally Assisted Proof of an Improved Upper Bound for Thrackles
- A short proof of a quadratic lower bound on the border determinantal complexity of x1n+⋯+xnn over ℂ: A simple human exposition
- A nearly tight bound on the probability G(n,p) is even-degenerate
BibTeX
@misc{adams2026tight,
title = {{Tight upper bound on $d_GH(S^1,S^2k+1)$: GPT's short proof}},
author = {Henry Adams},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.21587},
eprint = {2608.21587},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.21587},
}
RIS
TY - UNPB
TI - Tight upper bound on d_GH(S^1,S^2k+1): GPT's short proof
AU - Henry Adams
PY - 2026
DA - 2026/09/17
PB - arXiv
DO - 10.48550/arxiv.2608.21587
UR - https://arxiv.org/abs/2608.21587
AB - We describe GPT-5.6 Sol Pro's short proof that 2· d_GH(S^1,S^2k+1) ≤ 2πk/(2k+1). This is the odd-dimensional case of a tight upper bound by Harrison and Jeffs on the Gromov--Hausdorff distance between the circle and spheres.
ER -