LLM Framework for Discovering Major Mathematical Conjectures: AI's Quest for the Next Riemann Hypothesis
Not on the map. Why?
Abstract (arXiv)
Major mathematical conjectures still depend heavily on expert intuition, so a unified method for the systematic generation and validation of conjectures with substantial mathematical potential remains unavailable. We present a three stage pipeline for major conjecture discovery, with region search from explicit local evidence modules, reflective validation for foundationality, novelty, and potential significance, and formal validation in Lean 4 and Mathlib. The objective is the discovery of mathematical problems with high problem taste, namely problems whose proofs could reorganize the language of a research area and provide durable help to human mathematical research. Experiments on twenty candidates showstable passage from natural language to formal checks, with twenty out of twenty candidates passing Lean parsing and type checking, twenty out of twenty candidates not directly absorbed by exact?,twenty out of twenty candidates not automatically discharged by aesop, and no explicit duplicates or near duplicates.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 34 references that are in the map. First posted on arXiv 19 Apr 2026.
Builds on
25 of 34 references.
References · 25
- 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
- 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,317
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
- 2024The AI Scientist: Towards Fully Automated Open-Ended Scientific Discoverycited by 1,002
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
- 2025The AI Scientist-v2: Workshop-Level Automated Scientific Discovery via Agentic Tree Searchcited by 375
- 2024DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Datacited by 225
- 2024ScienceAgentBench: Toward Rigorous Assessment of Language Agents for Data-Driven Scientific Discoverycited by 208
- 2024DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Searchcited by 189
- 2024LLM-SR: Scientific Equation Discovery via Programming with Large Language Modelscited by 117
- 2025MLGym: A New Framework and Benchmark for Advancing AI Research Agentscited by 111
- 2025Mathematical exploration and discovery at scalecited by 66
13 more
- 2024Lean-STaR: Learning to Interleave Thinking and Provingcited by 64
- 2024TheoremLlama: Transforming General-Purpose LLMs into Lean4 Expertscited by 58
- 2021Constructions in combinatorics via neural networkscited by 46
- 2024Automated Statistical Model Discovery with Language Modelscited by 41
- 2024LeanAgent: Lifelong Learning for Formal Theorem Provingcited by 34
- 2024PatternBoost: Constructions in Mathematics with a Little Help from AIcited by 32
- 2025ProofBridge: Auto-Formalization of Natural Language Proofs in Lean via Joint Embeddingscited by 16
- 2025Mathesis: Towards Formal Theorem Proving from Natural Languagescited by 14
- 2025miniF2F-Lean Revisited: Reviewing Limitations and Charting a Path Forwardcited by 13
- 2025Advancing Geometry with AI: Multi-agent Generation of Polytopescited by 9
- 2025FormaRL: Enhancing Autoformalization with no Labeled Datacited by 9
- 2025LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Provingcited by 6
- 2025Lean-ing on Quality: How High-Quality Data Beats Diverse Multilingual Data in AutoFormalizationcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.