Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials
From MaRDI portal
Publication:3004359
DOI10.1090/S0002-9947-2011-05243-8zbMath1223.31003OpenAlexW2087947797MaRDI QIDQ3004359
Diego Armentano, Michael Shub, Carlos Beltran
Publication date: 1 June 2011
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-2011-05243-8
Inequalities and extremum problems involving convexity in convex geometry (52A40) Probabilistic potential theory (60J45) Discrete potential theory (31C20)
Related Items
A reverse Thomson problem on the unit circle ⋮ Average discrete energies of spectra of Gaussian random matrices ⋮ Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres ⋮ QMC designs: Optimal order Quasi Monte Carlo integration schemes on the sphere ⋮ A real quaternion spherical ensemble of random matrices ⋮ On extremums of sums of powered distances to a finite set of points ⋮ The Diamond ensemble: a constructive set of spherical points with small logarithmic energy ⋮ On the logarithmic energy of points on \(\mathbb{S}^2\) ⋮ Harmonic properties of the logarithmic potential and the computability of elliptic Fekete points ⋮ Efficient and accurate rotation of finite spherical harmonics expansions ⋮ On Gegenbauer point processes on the unit interval ⋮ An induced real quaternion spherical ensemble of random matrices ⋮ Energy of the Coulomb gas on the sphere at low temperature ⋮ Optimal \(N\)-point configurations on the sphere: ``magic numbers and Smale's 7th problem ⋮ Unnamed Item ⋮ A sharp Bombieri inequality, logarithmic energy and well conditioned polynomials ⋮ Random Riesz energies on compact Kähler manifolds ⋮ A facility location formulation for stable polynomials and elliptic Fekete points ⋮ Distributing many points on spheres: minimal energy and designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast linear homotopy to find approximate zeros of polynomial systems
- Computational cost of the Fekete problem. I: The forces method on the 2-sphere
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Minimal discrete energy on the sphere
- Complexity of Bezout's theorem. III: Condition number and packing
- Estimation of Fekete points
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- Energy of zeros of random sections on Riemann surfaces
- Complexity of Bezout's Theorem I: Geometric Aspects
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Asymptotics for minimal discrete energy on the sphere
- Unique Arrangements of Points on a Sphere
