Showing math.MGShow all
2 papers · 1 filter
math.MG2025
Bounds on Discrete Potentials of Spherical (k,k)-Designs
S. Borodachov, P. Boyvalenkov, P. Dragnev. D. Hardin. E. Saff +1
We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical -designs and provide certain examples…
math.MG2024
Energy bounds for weighted spherical codes and designs via linear programming
Sergiy Borodachov, Peter Boyvalenkov, Peter Dragnev +3
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…