Energy bounds for weighted spherical codes and designs via linear programming

DOI10.1007/S13324-024-01009-7MaRDI QIDQ7024945zbMATH OpenFDO

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

Publication date 20 February 2025

Published in Analysis and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13324-024-01009-7

zbMATH Keywords

energy boundlinear programmingweighted spherical code

Mathematics Subject Classification ID

Other designs, configurations (05B30) Linear programming (90C05) Combinatorial codes (94B25)

Cites work

• A survey on spherical designs and algebraic combinatorics on spheres
• An introduction to finite tight frames
• Bounds for spherical codes: the Levenshtein framework lifted
• Bounds for the sum of distances of spherical sets of small size
• Designs as maximum codes in polynomial metric spaces
• Discrete energy on rectifiable sets
• Energy bounds for codes in polynomial metric spaces
• Extremal dispositions of the points on the sphere
• Extremal polynomials used in bounds of code volume
• scientific article; zbMATH DE number 4073090 (Why is no real title available?)
• scientific article; zbMATH DE number 3680654 (Why is no real title available?)
• scientific article; zbMATH DE number 3461404 (Why is no real title available?)
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• scientific article; zbMATH DE number 3591295 (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 2166298 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• scientific article; zbMATH DE number 3194652 (Why is no real title available?)
• Linearization of the Product of Jacobi Polynomials. I
• Necessary conditions for existence of some designs in polynomial metric spaces
• On the Fejes Tóth problem about the sum of angles between lines
• On the sum of distances determined by a pointset
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Polynomial spaces
• Positive definite functions on spheres
• Spherical \((t,t)\)-designs with a small number of vectors
• Spherical codes and designs
• Spherical harmonics
• The minimum of potential energy of a System of point charges
• TheD₄Root System Is Not Universally Optimal
• Three-point bounds for energy minimization
• Universal lower bounds for potential energy of spherical codes
• Universally optimal distribution of points on spheres
• Upper bounds for energies of spherical codes of given cardinality and separation
• Upper bounds on the minimum distance of spherical codes

Cited in

(1)

• Bounds on energy and potentials of discrete measures on the sphere

This page was built for publication: Energy bounds for weighted spherical codes and designs via linear programming

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