<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Universally optimal distribution of points on spheres · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0607446/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/math_0607446/feed.xml" rel="self" type="application/rss+xml" /><item><title>Universally optimal distribution of points on spheres — mentioned by Cogito</title><link>https://news.ycombinator.com/item?id=19936487</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0607446:19936487</guid><pubDate>Fri, 17 May 2019 05:06:51 GMT</pubDate><description>&lt;p&gt;Seems like the crucial step here was being able to develop a systematic way to address every possible type of &amp;#x27;repulsive force&amp;#x27; in a given dimension, which then allowed them to show that the given solution (for example E8 in dimension 8) optimally solved the packing problem for each possible force. They talked about a few examples of the different repulsive forces that were characterised, but I wonder what they mean by all of those forces. It seems like there are an infinite way to parameterise a force between two points given a measure (by taking different functions of the distance between…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0607446/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.MG</category></item></channel></rss>
