3 papers
cs.AI2026
From LLM-Generated Conjectures to Lean Formalizations: Automated Polynomial Inequality Proving via Sum-of-Squares Certificates
Ruobing Zuo, Hanrui Zhao, Gaolei He +2
Automated proving of polynomial inequalities is a fundamental challenge in automated mathematical reasoning, where rich algebraic structure and a rapidly growing certificate search…
cs.LG2026
Automated Formal Proofs of Combinatorial Identities via Wilf-Zeilberger Guidance and LLMs
Beibei Xiong, Hangyu Lv, Junqi Liu +5
Automating formal proofs of combinatorial identities is challenging for LLM-based provers, as long-horizon proof planning is required and unconstrained search quickly explodes. Sym…
cs.AI2025
A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation
Beibei Xiong, Hangyu Lv, Haojia Shan +3
Large language models (LLMs) have significantly advanced formal theorem proving, yet the scarcity of high-quality training data constrains their capabilities in complex mathematica…