paper

Bounds for the sum of distances of spherical sets of small size

arXiv:2105.03511 · doi:10.1016/j.disc.2023.113346

Abstract

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N \sim n^{I^} \pm, 0 < I^\pm \leq 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical sets. We discuss asymptotic behavior of our bounds along with several examples of codes whose sum of distances closely follows the upper bound.

21 pp