Universal minima of discrete potentials for sharp spherical codes

DOI10.4171/RMI/1509MaRDI QIDQ7006401zbMATH OpenFDO

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

Publication date 28 March 2025

Published in Revista Matemática Iberoamericana (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4171/RMI/1509

zbMATH Keywords

linear programmingGauss-Jacobi quadraturediscrete potentialssharp spherical configurationsuniversal bounds on polarization of codes

Mathematics Subject Classification ID

Linear programming (90C05) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Bounds on codes (94B65) Higher-dimensional potential theory (31B99)

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3946218 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• scientific article; zbMATH DE number 3326519 (Why is no real title available?)
• A simple group of order 44,352,000
• A survey on spherical designs and algebraic combinatorics on spheres
• Absolute minima of potentials of certain regular spherical configurations
• Algebraic combinatorics. Translated from the Japanese
• Averaging sets: A generalization of mean values and spherical designs
• Bounds for spherical codes: the Levenshtein framework lifted
• Codes on Euclidean spheres
• Design theory from the viewpoint of algebraic combinatorics
• Designs as maximum codes in polynomial metric spaces
• Discrete energy on rectifiable sets
• Fisher type inequalities for Euclidean t-designs
• Indexes of spherical codes
• Linear programming bounds for covering radius of spherical designs
• Linearization of the Product of Jacobi Polynomials. I
• Lower bounds for spherical designs
• Min-max polarization for certain classes of sharp configurations on the sphere
• Necessary conditions for existence of some designs in polynomial metric spaces
• On Moore Graphs with Diameters 2 and 3
• On extremums of sums of powered distances to a finite set of points
• On polarization of spherical codes and designs
• On the regular and semi-regular figures in space of n dimensions.
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• Optimal asymptotic bounds for spherical designs
• Polarization problem on a higher-dimensional sphere for a simplex
• Spherical codes and designs
• Strongly regular graphs
• Strongly regular graphs having strongly regular subconstituents
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• Uniqueness of Certain Spherical Codes
• Uniqueness of the \((22,891,1/4)\) spherical code
• Universal lower bounds for potential energy of spherical codes
• Universally optimal distribution of points on spheres
• Well-separated spherical designs

Cited in

(3)

• Bounds on energy and potentials of discrete measures on the sphere
• Bounds on discrete potentials of spherical (k, k)-designs
• On the existence and non-existence of spherical m-stiff configurations

This page was built for publication: Universal minima of discrete potentials for sharp spherical codes

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