按年被提到
20252025 · 2 次2026
数学、逻辑与理论›数学猜想与重大证明·arXiv:2510.19804 · math.CO

Forbidden Sidon subsets of perfect difference sets, featuring a human-assisted proof

Boris Alexeev, Dustin G. Mixon · 2025
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2025-10-23 · 最近 2025-11-30
2不同的人
2活跃月份
2讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We resolve a $1000 Erdős prize problem, complete with formal verification generated by a large language model. 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. During the preparation of this paper, we discovered that although this problem was presumed to be open for half a century, Marshall Hall, Jr. published a different counterexample three decades before Erdős first posed the problem. With a healthy skepticism of this apparent oversight, and out of an abundance of caution, we used ChatGPT to vibe code a Lean proof of both Hall's and our counterexamples.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论menaerus · 2025-11

“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 > In over a dozen papers, beginning in 1976 and spanning two decades, Paul Erdős repeatedly posed one of his “favourite” conjectures: every …”

AI just proved Erdos Problem #124原评论 ↗
被提交为 story · 1 次