<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Equiangular Lines and Spherical Codes in Euclidean Space · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1606.06620/</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/1606.06620/feed.xml" rel="self" type="application/rss+xml" /><item><title>Equiangular Lines and Spherical Codes in Euclidean Space — mentioned by zellyn</title><link>https://news.ycombinator.com/item?id=14115263</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.06620:14115263</guid><pubDate>Fri, 14 Apr 2017 16:08:38 GMT</pubDate><description>&lt;p&gt;In the penultimate paragraph, they say, &amp;quot;As a result, the authors were able to prove that when you begin by fixing the angle in advance, the maximum number of equiangular lines is 2d – 2 for one particular angle (approximately 70.7 degrees), and no more than 1.93d for any other angle.&amp;quot; Earlier, they show that in 3 dimensions, you can arrange 6 lines. 2 &amp;gt; 1.93, so I guess either I or they misunderstood something. [Edit] &amp;quot;for…sufficiently large n&amp;quot; https://arxiv.org/abs/1606.06620 “in this paper we prove that for every fixed angle θ and sufficiently large n there are at most 2n−2 lines in ℝn…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.06620/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
