AI RESEARCH
Automated Formal Proofs of Combinatorial Identities via Wilf-Zeilberger Guidance and LLMs
arXiv CS.LG
•
ArXi:2605.04472v1 Announce Type: new Automating formal proofs of combinatorial identities is challenging for LLM-based provers, as long-horizon proof planning is required and unconstrained search quickly explodes. Symbolic methods such as the Wilf-Zeilberger (WZ) method can achieve a mechanized proof of combinatorial identities by constructing special auxiliary functions and nstrating that they satisfy specific recurrence relations.