arXiv (All)
open access
Nonexistence of Strongly Regular Graphs via Gegenbauer Positivity and SRG Counting
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 exp
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
- The $C^{p'}$-regularity conjecture near $p=2$#996772
- Incidence Rank and Bounded Defect for Linear Hypergraphs with Cograph Line Graphs#1064321
- The Erdős--Chvátal Simplex Conjecture#1083902
- Radial-type error bounds for semidefinite feasibility problems without strict feasibility: qualitative estimates and asymptotic tightness#684577
- Radial-type error bounds for semidefinite feasibility problems without strict feasibility: qualitative estimates and asymptotic tightness#682801
Record · ID 1355188
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