Energy bounds for weighted spherical codes and designs via linear
programming
Energy bounds for weighted spherical codes and designs via linear
programming
Universal bounds for the potential energy of weighted spherical codes are obtained by linear programming. The universality is in the sense of Cohn-Kumar -- every attaining code is optimal with respect to a large class of potential functions (absolutely monotone), in the sense of Levenshtein -- there is a bound …