Metraipolis › archive › dc_38bcb924345d

Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting — arXiv:2610.20259

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20259
License (as archived)
CC0-1.0
Archived
2026-10-15T21:52:47.005Z
SHA-256 of the archived text
511726aed916017f9ddfaad45f12558f7ad163e694ae4ea87ca3e30d23b8e313
Stable URL of this page
https://metraipolis.com/documento/dc_38bcb924345d

How to cite

Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting — arXiv:2610.20259 — arXiv (en), https://arxiv.org/abs/2610.20259 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_38bcb924345d (Metraipolis archive dc_38bcb924345d, sha256 511726aed916017f9ddfaad45f12558f7ad163e694ae4ea87ca3e30d23b8e313)
BibTeX
@misc{dc38bcb924345d,
  title = {Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting — arXiv:2610.20259},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20259},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_38bcb924345d; sha256 511726aed916017f9ddfaad45f12558f7ad163e694ae4ea87ca3e30d23b8e313},
  year = {2026}
}

Archived text

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

This paper develops a natural extension of the multipoint spherical semidefinite method of Liao and Yu~\cite{LY}, studying the interaction between semidefinite programming and strongly regular graph counting. Starting from the positive semidefinite kernels furnished by Gegenbauer polynomials, we express weighted kernel sums and counting identities in the same labelled induced-subgraph counts. Eliminating the counting equations gives a semidefinite feasibility problem. Numerical dual solutions guide the construction of rational certificates, whose contradiction identities are verified exactly. Our aim is a systematic method that treats many parameter sets through the same construction. For least eigenvalue $-3$, it gives new counting certificates for $(351,140,73,44)$, $(550,162,75,36)$, $(703,182,81,35)$ and $(1344,221,88,26)$, previously excluded by Liao and Yu~\cite[Theorem~1]{LY}, and for six additional parameter sets: \[ \begin{array}{@{}lll@{}} (375,102,45,21), & (405,132,63,33), & (441,88,35,13),\\ (476,133,60,28), & (540,147,66,30), & (575,112,45,16). \end{array} \] Seven certificates use Gegenbauer positivity and counting information alone at the displayed orders. The cases $v=375,441,575$ additionally use proved short-vector restrictions, unique vertex extensions, and integer common-neighbour inequalities. The proofs end in displayed inequalities with incompatible signs. Their justification is given by the dual identities and the proved positivity and counting relations; accompanying code automates the longer rational arithmetic.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.20259 — 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-15T21:37:14.437Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).