The paper announces a new lower bound of 0.8559 for the Steiner ratio, improving on the previous 0.824 bound for the Gilbert‑Pollak Conjecture. It introduces an AI system that uses large language models to generate rule‑constrained geometric lemmas, which are then turned into executable verification functions that certify the bound. The approach relies on only thousands of LLM calls, highlighting the feasibility of LLM‑based methods for advanced mathematical research.
By Yisi Ke, Tianyu Huang, Yankai Shu, Di He, Jingchu Gai, Liwei Wang
AutoGraphForge is a computational pipeline designed to automate the discovery, refutation, formalization, and proving of graph-theoretic conjectures. It generates conjectures using a Graffiti3 generator, filters out known results with a novelty filter, tests candidates against a large dataset of graphs, and refines surviving conjectures through counterexample search. The pipeline then translates each conjecture into Lean 4, verifies proofs with neural provers, and integrates the results into a formal library.
By J\'an Pastorek
arXiv:2606. 18119v1 Announce Type: new Abstract: To assess the ability of current AI systems to correctly solve research-level mathematics problems, we tested several AI systems on a set of ten problems in a broad range of mathematical fields; these problems arose naturally in the research process of the contributors.
By Mohammed Abouzaid, Nikhil Srivastava, Rachel Ward, Lauren Williams
arXiv:2606. 02484v1 Announce Type: new Abstract: Recent advances in large language models and agentic AI systems have enabled significant progress in mathematical discovery, from solving competition problems to tackling research-level conjectures.
By Leheng Chen, Zihao Liu, Wanyi He, Bin Dong
arXiv:2607. 20525v1 Announce Type: new Abstract: OpenAI's recent disproof of the Erd\H{o}s unit distance conjecture marked a milestone for AI in mathematics.
By Yichen Huang
arXiv:2608. 08118v1 Announce Type: new Abstract: There are several methods for searching for graphs with prescribed properties, such as SAT solvers and specialized generators.
By David Seka, Stefan Szeider