Metraipolis › archive › dc_e0dbce702e70

Nonexistence of strongly regular graphs via multipoint spherical semidefinite bounds — arXiv:2609.37901

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37901
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:47.384Z
SHA-256 of the archived text
0ee20afebafd46a8610ace2a5b406289d1e995ce29a571b2931737be4766290c
Stable URL of this page
https://metraipolis.com/documento/dc_e0dbce702e70

How to cite

Nonexistence of strongly regular graphs via multipoint spherical semidefinite bounds — arXiv:2609.37901 — arXiv (en), https://arxiv.org/abs/2609.37901 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e0dbce702e70 (Metraipolis archive dc_e0dbce702e70, sha256 0ee20afebafd46a8610ace2a5b406289d1e995ce29a571b2931737be4766290c)
BibTeX
@misc{dce0dbce702e70,
  title = {Nonexistence of strongly regular graphs via multipoint spherical semidefinite bounds — arXiv:2609.37901},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37901},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e0dbce702e70; sha256 0ee20afebafd46a8610ace2a5b406289d1e995ce29a571b2931737be4766290c},
  year = {2026}
}

Archived text

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

We use multipoint semidefinite programming to prove the nonexistence of strongly regular graphs. A normalized eigenspace projection of a primitive strongly regular graph gives a spherical two-distance set with one point for each vertex. A bound smaller than the required number of points therefore rules out the graph. Following the formulations of de Laat et al. and Kao and Yu, we use, for each reference type, coefficient matrices indexed by the feasible inner-product labels of the selected points. In degree zero, we combine the matrix coordinates indexed by the reference points into a single coordinate. The resulting programs use configurations of up to six points, with matrix orders at most $2^m+1$ for a reference set of $m$ points. Feasible dual solutions, verified in exact rational arithmetic, exclude strongly regular graphs with parameters $(351,140,73,44)$, $(550,162,75,36)$, $(703,182,81,35)$ and $(1344,221,88,26)$.

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