AI-generated short proofs resolve multiple open conjectures in combinatorics.
Short proofs in combinatorics, probability and number theory II
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any cycle, a counterexample to a "fewnomial" version of the Erd\H{o}s--Tur\'{a}n discrepancy bound, and a finiteness theorem for integers $n$ such that $n-a k^2$ is prime for all $k\leq \sqrt{n/a}$ coprime to $n$ (for fixed $a\in\mathbb Z_+$). Each proof is due to an internal model at OpenAI.
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
An interactive AI workbench for mathematicians achieves 48% on FrontierMath Tier 4 and helped solve open problems in early tests.
citing papers explorer
-
Short Proofs in Algebraic and Enumerative Combinatorics
AI-generated short proofs resolve multiple open conjectures in combinatorics.
-
AI co-mathematician: Accelerating mathematicians with agentic AI
An interactive AI workbench for mathematicians achieves 48% on FrontierMath Tier 4 and helped solve open problems in early tests.
- Soohak: A Mathematician-Curated Benchmark for Evaluating Research-level Math Capabilities of LLMs