arXiv (All)
open access
Nonexistence of strongly regular graphs via multipoint spherical semidefinite bounds
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 ru
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Spectral extremal hypergraphs without long Berge cycles#1051523
- On minimal regular graphs with given constraintsm#1041667
- There is no $8$-regular $K_3$-irregular graph#1142280
- Verified Length Spectrum and Margulis number for Hyperbolic 3-Manifolds#1062550
- Regular hyperbolic tilings have no $\ell^2$ eigenfunctions#1056380
Record · ID 1142207
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive