arXiv (All)
open access
Semidefinite programming bounds for distance distribution of spherical codes
Semidefinite programming bounds for spherical codes usually involve polynomials in several inner products. We show how these bounds lead to inequalities for the distance distribution involving only a polynomial of one variable. This polynomial need not have nonnegative Gegenbauer coefficients, since
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
- A Truncated Singular-Value Bound for Spectral Variation of Normal Matrices#986950
- On Coupling Constraints in Pessimistic Linear Bilevel Optimization#388224
- Near-uniform $q$-matroids#1142138
- Upper Bounds for the Euclidean Operator Radius and Applications#190776
- Linear programming bounds for binary and ternary LCD Codes#1109155
Record · ID 1118357
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