arXiv (All)
open access
The half-rate linear programming bound for binary codes is $\frac12-\frac1π$
In their work on sphere packing and the conformal bootstrap, Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini conjectured the exact high-dimensional exponent of the Cohn--Elkies sphere-packing linear program. OpenAI's Chapter 1 subsequently proved their conjecture by establishing that both Fourier
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
- Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs#1077078
- The $A$-optimal design problem and the $S$-matrix conjecture#1034074
- The tree packing conjecture for trees of almost linear maximum degree#986755
- A Tight Erdős-Stone Bound for All Graph Densities#821533
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
Record · ID 926627
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