Universal lower bounds for potential energy of spherical codes

DOI10.1007/s00365-016-9327-5zbMath1404.94154arXiv1503.07228OpenAlexW1814198588MaRDI QIDQ730083

M. M. Stoyanova, Peter D. Dragnev, P. G. Boyvalenkov, Douglas P. Hardin, Edward 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

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

Related Items (18)

The Gaussian core model in high dimensions ⋮ Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) ⋮ Five point energy minimization: a synopsis ⋮ STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES ⋮ Bounds for the sum of distances of spherical sets of small size ⋮ Upper bounds for energies of spherical codes of given cardinality and separation ⋮ Low-energy points on the sphere and the real projective plane ⋮ On polarization of spherical codes and designs ⋮ Upper energy bounds for spherical designs of relatively small cardinalities ⋮ On spherical codes with inner products in a prescribed interval ⋮ On maximal antipodal spherical codes with few distances ⋮ Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes ⋮ Energy bounds for codes and designs in Hamming spaces ⋮ On spherical designs of some harmonic indices ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Majorization and Minimal Energy on Spheres ⋮ ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS ⋮ Bounds for spherical codes: The Levenshtein framework lifted

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
• Extremal polynomials used in bounds of code volume
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• Tight spherical designs. I
• Necessary conditions for existence of some designs in polynomial metric spaces
• Distributing many points on a sphere
• Extremal dispositions of the points on the sphere
• Gaussian, Lobatto and Radau positive quadrature rules with a prescribed abscissa
• The kissing number in four dimensions
• An upper bound on Jacobi polynomials
• Spherical harmonics
• Experimental Study of Energy-Minimizing Point Configurations on Spheres
• Universally optimal distribution of points on spheres
• Tight Spherical Disigns, II
• Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
• The Addition Formula for Jacobi Polynomials and Spherical Harmonics
• Upper bounds on the minimum distance of spherical codes
• Three-point bounds for energy minimization
• Asymptotics for discrete weighted minimal Riesz energy problems on rectifiable sets
• TheD₄Root System Is Not Universally Optimal

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