https://hackerpaper.kaipfister.de/p/2209.10045/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=38647917urn:hackerpapers:mention:2209.10045:38647917Thu, 14 Dec 2023 22:00:58 GMT<p>&gt; An LLM can discover a new solution in high dimensional geometry that hasn’t advanced in 20 years!? That goes way beyond glueing little bits of plagiarized training data together in a plausible way. The first advance in 20 years was by Fred Tyrrell last year https://arxiv.org/abs/2209.10045, who showed that the combinatorics quantity in question is between 2.218 and 2.756, improving the previous lower bound of 2.2174. DeepMind has now shown that the number is between 2.2202 and 2.756. That&#x27;s why the DeepMind authors describe it as &quot;the largest increase in the size of cap sets in the past 20…</p><p><a href="https://hackerpaper.kaipfister.de/p/2209.10045/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.CO