On polarization of spherical codes and designs
From MaRDI portal
Publication:2695978
DOI10.1016/j.jmaa.2023.127065OpenAlexW4319018740MaRDI QIDQ2695978
Edward B. Saff, M. M. Stoyanova, P. G. Boyvalenkov, Douglas P. Hardin, Peter D. Dragnev
Publication date: 5 April 2023
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.08807
Other designs, configurations (05B30) Spherical and hyperbolic convexity (52A55) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (3)
Least distortion Euclidean embeddings of flat tori ⋮ Absolute minima of potentials of certain regular spherical configurations ⋮ Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal asymptotic bounds for spherical designs
- On extremums of sums of powered distances to a finite set of points
- Universal lower bounds for potential energy of spherical codes
- A survey on spherical designs and algebraic combinatorics on spheres
- Averaging sets: A generalization of mean values and spherical designs
- Designs as maximum codes in polynomial metric spaces
- Spherical codes and designs
- On the rigidity of spherical \(t\)-designs that are orbits of finite reflection groups
- A minimal design of order 11 on the 3-sphere
- On spherical codes with inner products in a prescribed interval
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Linear programming bounds for covering radius of spherical designs
- Polarization problem on a higher-dimensional sphere for a simplex
- Algebraic combinatorics. Translated from the Japanese
- Well-separated spherical designs
- Energy bounds for codes in polynomial metric spaces
- Design theory from the viewpoint of algebraic combinatorics
- The kissing number in four dimensions
- Universally optimal distribution of points on spheres
- Discrete Energy on Rectifiable Sets
- TheD4Root System Is Not Universally Optimal
- Bounds for spherical codes: The Levenshtein framework lifted
- Uniqueness of the 120-point spherical 11-design in four dimensions
This page was built for publication: On polarization of spherical codes and designs
