Experimental study of energy-minimizing point configurations on spheres
From MaRDI portal
Publication:3401653
DOI10.1080/10586458.2009.10129052zbMATH Open1185.68771arXivmath/0611451OpenAlexW2152345982MaRDI QIDQ3401653FDOQ3401653
Authors: Brandon Ballinger, Grigoriy Blekherman, Henry Cohn, Noah Giansiracusa, E. Kelly, Achill Schürmann 
Publication date: 1 February 2010
Published in: Experimental Mathematics (Search for Journal in Brave)
Abstract: In this paper we report on massive computer experiments aimed at finding spherical point configurations that minimize potential energy. We present experimental evidence for two new universal optima (consisting of 40 points in 10 dimensions and 64 points in 14 dimensions), as well as evidence that there are no others with at most 64 points. We also describe several other new polytopes, and we present new geometrical descriptions of some of the known universal optima.
Full work available at URL: https://arxiv.org/abs/math/0611451
Recommendations
Cited In (41)
- Exploiting symmetries in polyhedral computations
- Generation of energy-minimizing point sets on spheres and their application in mesh-free interpolation and differentiation
- Three-point bounds for energy minimization
- Point configurations that are asymmetric yet balanced
- Packings in real projective spaces
- Optimal configurations of lines and a statistical application
- Design theory from the viewpoint of algebraic combinatorics
- Energy Minimization, Periodic Sets and Spherical Designs
- Log-optimal (𝑑+2)-configurations in 𝑑–dimensions
- Title not available (Why is that?)
- Newton algorithm on constraint manifolds and the 5-electron Thomson problem
- An approach to distribute the marker points on non-spherical particle/boundary surface within the IBM-LBM framework
- A faster interior-point method for sum-of-squares optimization
- Globally optimizing small codes in real projective spaces
- Bounds for spherical codes: the Levenshtein framework lifted
- Sum-of-squares optimization without semidefinite programming
- The contact polytope of the Leech lattice
- Cubature formulas in numerical analysis and Euclidean tight designs
- A survey on spherical designs and algebraic combinatorics on spheres
- Delaunay polytopes derived from the Leech lattice
- Observed asymptotic differences in energies of stable and minimal point configurations on \(\mathbb{S}^2\) and the role of defects
- Energy minimization of repelling particles on a toric grid
- Spectrally optimized pointset configurations
- Association schemes related to Delsarte-Goethals codes
- Geometric designs and rotatable designs. I
- Order and disorder in energy minimization
- Optimal and near optimal configurations on lattices and manifolds. Abstracts from the workshop held August 19--25, 2012.
- Numerical approximation of diffusive capture rates by planar and spherical surfaces with absorbing pores
- Constrained shrinking dimer dynamics for saddle point search with constraints
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- Random Riesz energies on compact Kähler manifolds
- Universally optimal distribution of points on spheres
- Frame Potential in CPn Some Numerical and Analytical Results
- Five point energy minimization: a synopsis
- Coordination control of multiple Euler-Lagrange systems for escorting mission
- Universal lower bounds for potential energy of spherical codes
- Upper bounds for energies of spherical codes of given cardinality and separation
- On extremums of sums of powered distances to a finite set of points
- Distributing many points on spheres: minimal energy and designs
- Quasi-Monte Carlo rules for numerical integration over the unit sphere \({\mathbb{S}^2}\)
Uses Software
This page was built for publication: Experimental study of energy-minimizing point configurations on spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401653)
