Forbidden Sidon subsets of perfect difference sets, featuring a human-assisted proof · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2510.19804/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTForbidden Sidon subsets of perfect difference sets, featuring a human-assisted proof — mentioned by menaerushttps://news.ycombinator.com/item?id=46094768urn:hackerpapers:mention:2510.19804:46094768Sun, 30 Nov 2025 08:02:18 GMT<p>This seems to be 2nd in row proof from the same author by using the AI models. First time it was the ChatGPT which wrote the formal Lean proof for Erdos Problem #340. https://arxiv.org/html/2510.19804v1#Thmtheorem3 &gt; In over a dozen papers, beginning in 1976 and spanning two decades, Paul Erdős repeatedly posed one of his “favourite” conjectures: every finite Sidon set can be extended to a finite perfect difference set. We establish that {1, 2, 4, 8, 13} is a counterexample to this conjecture.</p><p><a href="https://hackerpaper.kaipfister.de/p/2510.19804/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.COForbidden Sidon subsets of perfect difference sets, featuring a human-assisted proof — HN submissionhttps://news.ycombinator.com/item?id=45680442urn:hackerpapers:submission:2510.19804:45680442Thu, 23 Oct 2025 10:59:38 GMT<p>Resolving a $1000 Erdős problem, and vibe coding a Lean proof using ChatGPT</p><p></p><p>5 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2510.19804/">Paper and source history</a>. A submission is not an endorsement.</p>math.CO