Afkhami-Jeddi–Cohn–Hartman–de Laat–Tajdini conjecture on Delsarte-bound rates
Let denote the asymptotic rate supplied by Delsarte's linear-programming bound for binary codes of relative distance , and let denote the corresponding -dimensional Cohn–Elkies linear-programming bound for spherical codes or sphere packing, in the normalization of the cited sources. The conjecture includes the assertions and , equivalently that the associated exponent is .
References
- The Rate of the Delsarte Bound for Binary Codes and Spheres — arXiv — Andrew Salmon
Source: arXiv
Progress summary
An unrefereed 2026 manuscript claims to settle the conjecture, but no independent verification was found.
The conjecture concerns the exact asymptotic rate of the Delsarte linear-programming bound for binary and spherical codes, including the related Cohn–Elkies sphere-packing program.
October 15, 2026 claimed resolution
Andrew Salmon’s report claims that the obstacle problem gives the lower bound and an interlacing-spectrum construction gives a matching upper bound, with and exponent . Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini’s preprint separately records the binary rate and attributes the high-dimensional Cohn–Elkies result to “OpenAI’s Chapter 1.” These are claims, not verified results.
Current status (as of October 2026): A claimed complete resolution gives the conjectured asymptotic rate, but it remains unverified; no independent assessment or correction was retrieved.
Sources
Solutions 0
No solutions have been posted yet.