OpenAlex ·
Nonexistence of strongly regular graphs via multipoint spherical semidefinite bounds
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.37901
- Original
- Read it at the publisher
- Topics
Abstract
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)$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
The Reach of Abelian Covers in Hypergraphs
MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One
Order-Optimal Systematic Permutation Codes for Correcting t Deletions
Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise
On the nonnegativity of monomial immanants for hook partitions
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.