On polarization of spherical codes and designs
From MaRDI portal
Publication:6405367
DOI10.1016/J.JMAA.2023.127065arXiv2207.08807MaRDI QIDQ6405367FDOQ6405367
Authors: Peter Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova
Publication date: 15 July 2022
Abstract: In this article we investigate the -point min-max and the max-min polarization problems on the sphere for a large class of potentials in . We derive universal lower and upper bounds on the polarization of spherical designs of fixed dimension, strength, and cardinality. The bounds are universal in the sense that they are a convex combination of potential function evaluations with nodes and weights independent of the class of potentials. As a consequence of our lower bounds, we obtain the Fazekas-Levenshtein bounds on the covering radius of spherical designs. Utilizing the existence of spherical designs, our polarization bounds are extended to general configurations. As examples we completely solve the min-max polarization problem for points on and show that the -cell is universally optimal for that problem. We also provide alternative methods for solving the max-min polarization problem when the number of points does not exceed the dimension and when . We further show that the cross-polytope has the best max-min polarization constant among all spherical -designs of points for ; for , this statement is conditional on a well-known conjecture that the cross-polytope has the best covering radius. This max-min optimality is also established for all so-called centered codes.
Other designs, configurations (05B30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Theory of error-correcting codes and error-detecting codes (94B99) Spherical and hyperbolic convexity (52A55)
This page was built for publication: On polarization of spherical codes and designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405367)