Metraipolis › archive › dc_c511d181c132
Johnson optimality and uniqueness for distance ratio $1:\sqrt{2}$ — arXiv:2610.40367
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40367
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:38:06.504Z
- SHA-256 of the archived text
843278c492138d12d96fba1d9be20f7b168092642045eae9cfa8e256ed6aa76e- Stable URL of this page
https://metraipolis.com/documento/dc_c511d181c132
How to cite
Johnson optimality and uniqueness for distance ratio $1:\sqrt{2}$ — arXiv:2610.40367 — arXiv (en), https://arxiv.org/abs/2610.40367 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c511d181c132 (Metraipolis archive dc_c511d181c132, sha256 843278c492138d12d96fba1d9be20f7b168092642045eae9cfa8e256ed6aa76e)
BibTeX
@misc{dcc511d181c132,
title = {Johnson optimality and uniqueness for distance ratio $1:sqrt2$ — arXiv:2610.40367},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40367},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c511d181c132; sha256 843278c492138d12d96fba1d9be20f7b168092642045eae9cfa8e256ed6aa76e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40367. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that a two-distance set in $\mathbb R^d$ with distance ratio $1:\sqrt{2}$ has at most $d(d+1)/2$ points for every $d\ge9$. Equality in full affine dimension characterizes the Johnson construction; for $d\ge10$, the full-dimensional condition is automatic. The proof separates configurations according to the connectivity of the short-distance graph. The connected case uses root lattices and intersection theorems, while the disconnected case uses an orthogonal decomposition into component direction spaces and the span of their center differences. We also prove a relative bound for Euclidean two-distance sets and show that equality forces sphericity. Together with the Larman--Rogers--Seidel theorem, these results give maximum cardinality $d(d+1)/2$ for $9\le d\le21$ and $275$ for $d=22$, without exhaustive enumeration.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2610.40367 — 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-01T02:15:28.293Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).