Universal upper and lower bounds on energy of spherical designs

DOI10.14658/PUPJ-DRNA-2015-SPECIAL_ISSUE-6MaRDI QIDQ5355322zbMATH OpenOpenAlexFDO

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

Publication date 7 September 2017

Full work available at URL https://arxiv.org/abs/1509.07837, http://www.emis.de/journals/DRNA/6-4.html

Mathematics Subject Classification ID

Discrete potential theory (31C20) Linear programming (90C05)

Abstract: Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds are optimal for absolutely monotone potentials in the sense that for the linear programming technique they cannot be improved by using polynomials of the same or lower degree. When additional information about the structure (upper and lower bounds for the inner products) of the designs is known, improvements on the bounds are obtained. Furthermore, we provide `test functions' for determining when the linear programming lower bounds for energy can be improved utilizing higher degree polynomials. We also provide some asymptotic results for these energy bounds.

Recommendations

• Upper energy bounds for spherical designs of relatively small cardinalities
• Upper bounds for energies of spherical codes of given cardinality and separation
• Universal lower bounds for potential energy of spherical codes
• Linear Programming Bounds for Spherical (k,k)-Designs
• On linear programming bounds for spherical codes and designs

Cited in

(13)

• Comparison of probabilistic and deterministic point sets on the sphere
• Generating an equidistributed net on a sphere using random rotations
• Upper bounds for energies of spherical codes of given cardinality and separation
• Upper energy bounds for spherical designs of relatively small cardinalities
• Classification of spherical 2-distance \(\{4,2,1\}\)-designs by solving Diophantine equations
• Energy bounds for codes in polynomial metric spaces
• Design theory from the viewpoint of algebraic combinatorics
• Bounds for the sum of distances of spherical sets of small size
• Energy Minimization, Periodic Sets and Spherical Designs
• On Euclidean designs and potential energy
• Efficient spherical designs with good geometric properties
• Estimates for Logarithmic and Riesz Energies of Spherical t-Designs
• Universal lower bounds for potential energy of spherical codes

This page was built for publication: Universal upper and lower bounds on energy of spherical designs

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