Universal lower bounds for potential energy of spherical codes

DOI10.1007/S00365-016-9327-5MaRDI QIDQ730083zbMATH OpenOpenAlexFDO

Authors Peter Boyvalenkov, P. D. Dragnev, M. M. Stoyanova, D. P. Hardin, E. B. Saff

Publication date 23 December 2016

Published in Constructive Approximation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.07228

zbMATH Keywords

linear programmingminimal energy problemsDelsarte-Goethals-Seidel boundsLevenshtein boundsspherical codes and designsspherical potentials

Mathematics Subject Classification ID

Other designs, configurations (05B30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Bounds on codes (94B65)

Abstract: We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees in the Delsarte-Yudin method. However, improvements are sometimes possible and we provide a necessary and sufficient condition for the existence of such better bounds. All our bounds can be obtained in a unified manner that does not depend on the potential function, provided the potential is given by an absolutely monotone function of the inner product between pairs of points, and this is the reason for us to call them universal. We also establish a criterion for a given code of dimension $n$ and cardinality $N$ not to be LP-universally optimal, e.g. we show that two codes conjectured by Ballinger et al to be universally optimal are not LP-universally optimal.

Recommendations

• Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
• Bounds for spherical codes: the Levenshtein framework lifted
• Upper bounds for energies of spherical codes of given cardinality and separation
• Universal upper and lower bounds on energy of spherical designs
• On spherical codes with inner products in a prescribed interval

Cites work

• scientific article; zbMATH DE number 3818560 (Why is no real title available?)
• scientific article; zbMATH DE number 3179593 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• scientific article; zbMATH DE number 1259471 (Why is no real title available?)
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• scientific article; zbMATH DE number 1341365 (Why is no real title available?)
• scientific article; zbMATH DE number 2077080 (Why is no real title available?)
• scientific article; zbMATH DE number 2115103 (Why is no real title available?)
• scientific article; zbMATH DE number 819734 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• An upper bound on Jacobi polynomials
• Asymptotics for discrete weighted minimal Riesz energy problems on rectifiable sets
• Designs as maximum codes in polynomial metric spaces
• Distributing many points on a sphere
• Experimental study of energy-minimizing point configurations on spheres
• Extremal dispositions of the points on the sphere
• Extremal polynomials used in bounds of code volume
• Gaussian, Lobatto and Radau positive quadrature rules with a prescribed abscissa
• Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
• Minimum of the energy potential of a point system of charges
• Necessary conditions for existence of some designs in polynomial metric spaces
• Spherical codes and designs
• Spherical harmonics
• The Addition Formula for Jacobi Polynomials and Spherical Harmonics
• The kissing number in four dimensions
• TheD₄Root System Is Not Universally Optimal
• There are finitely many Q-polynomial association schemes with given first multiplicity at least three
• Three-point bounds for energy minimization
• Tight Spherical Disigns, II
• Tight spherical designs. I
• Universally optimal distribution of points on spheres
• Upper bounds on the minimum distance of spherical codes

Cited in

(19)

• On spherical codes with inner products in a prescribed interval
• Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
• On maximal antipodal spherical codes with few distances
• STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
• Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)
• Majorization and minimal energy on spheres
• Energy bounds for codes in polynomial metric spaces
• Asymptotic linear programming lower bounds for the energy of minimizing Riesz and Gauss configurations
• Bounds for spherical codes: the Levenshtein framework lifted
• On polarization of spherical codes and designs
• Upper energy bounds for spherical designs of relatively small cardinalities
• Bounds for the sum of distances of spherical sets of small size
• Universal upper and lower bounds on energy of spherical designs
• Five point energy minimization: a synopsis
• Low-energy points on the sphere and the real projective plane
• Energy bounds for codes and designs in Hamming spaces
• The Gaussian core model in high dimensions
• Upper bounds for energies of spherical codes of given cardinality and separation
• On spherical designs of some harmonic indices

This page was built for publication: Universal lower bounds for potential energy of spherical codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730083)