New mathematical bounds improve spherical code design and energy limits

Levenshtein-type bounds for $(a,b)$-avoiding spherical codes

Information Theory

Summary

The paper studies spherical codes, which are sets of points on a sphere with certain spacing properties. The authors develop new mathematical tools to find the largest possible number of points that avoid specific inner product ranges between them. They also establish lower bounds on the minimum energy configurations of these points. Their approach uses and extends linear programming techniques and special polynomials, allowing for precise and sometimes unique optimal solutions under certain conditions.

What this means in practice

A theory result. No direct application yet.

Authors

Peter Boyvalenkov, Danila Cherkashin, Peter Dragnev, Peter Grabner

Abstract

We develop a Levenshtein-type linear programming framework (for maximal $s$-codes and for minimal energy) for $(a,b)$-avoiding spherical codes, that is, codes whose inner products between distinct points avoid $(a,b)$. We introduce and investigate signed measures that are positive definite up to an appropriate degree and yield stationary auxiliary linear programming polynomials and exact quadrature formulas. We give explicit conditions for positivity of the quadrature weights and sufficient Krein-type conditions for nonnegative Gegenbauer coefficients (positive definiteness of the candidate optimal linear programming polynomials). Under these hypotheses and suitable node-location assumptions, the resulting cardinality bounds are optimal within the corresponding degree restriction and unique under natural nondegeneracy conditions. Under proper conditions on the quadrature nodes, we obtain universal lower energy bounds by utilizing Hermite interpolants as polynomial solutions of the respective linear program. Common test functions characterize optimality in the full polynomial linear programs under mild additional assumptions.