Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting
Abstract
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: @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). 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.
Related
- Nonexistence of strongly regular graphs via multipoint spherical semidefinite bounds
- Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof
- Enumeration of small vertex-transitive directed strongly regular graphs
- Coherent configuration on 3-uniform hypergraph over strongly regular graph
- An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure
BibTeX
@misc{liao2026nonexistence,
title = {{Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting}},
author = {Zhen-Qi Liao and Jiaxin Wang and Wei-Hsuan Yu and Jianfeng Cai},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.20259},
eprint = {2610.20259},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.20259},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting
AU - Zhen-Qi Liao
AU - Jiaxin Wang
AU - Wei-Hsuan Yu
AU - Jianfeng Cai
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.20259
UR - https://arxiv.org/abs/2610.20259
AB - 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: @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). 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.
ER -