ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS
From MaRDI portal
Publication:3121299
DOI10.1112/S0025579318000360zbMath1410.28004arXiv1804.05237WikidataQ129063014 ScholiaQ129063014MaRDI QIDQ3121299
T. J. Michaels, Douglas P. Hardin, Edward B. Saff
Publication date: 15 March 2019
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.05237
Related Items (1)
Cites Work
- Matrix Gegenbauer polynomials: the \(2\times 2\) fundamental cases
- Universal lower bounds for potential energy of spherical codes
- Designs as maximum codes in polynomial metric spaces
- Spherical codes and designs
- The Gaussian core model in high dimensions
- Matrix-valued Gegenbauer-type polynomials
- Minimal Riesz energy point configurations for rectifiable \(d\)-dimensional manifolds
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
- Large deviation principles for hypersingular Riesz gases
- Universally optimal distribution of points on spheres
- Asymptotics of best-packing on rectifiable sets
- Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
- Asymptotics for minimal discrete energy on the sphere
- Asymptotics for Minimal Discrete Riesz Energy on Curves in ℝd
- Discrete Energy on Rectifiable Sets
- Asymptotics for discrete weighted minimal Riesz energy problems on rectifiable sets
- The next-order term for optimal Riesz and logarithmic energy asymptotics on the sphere
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS