arXiv AI By Tom Adamczewski

OEIS Open: How many conjectures can language models turn into theorems?

Read the original on arXiv AI →

arXiv:2608. 11941v1 Announce Type: new Abstract: We construct OEIS Open, a benchmark based on 492 open mathematical conjectures from the OEIS, formalized in Lean by Tsoukalas et al.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 9

Advancing Mathematics Research with AI-Driven Formal Proof Search

arXiv:2605. 22763v2 Announce Type: replace Abstract: Large language models (LLMs) increasingly excel at mathematical reasoning, but their unreliability limits their utility in mathematics research.

By George Tsoukalas, Anton Kovsharov, Sergey Shirobokov, Anja Surina, Moritz Firsching, Gergely B\'erczi, Francisco J. R. Ruiz, Arun Suggala, Adam Zsolt Wagner, Eric Wieser, Lei Yu, Aja Huang, Mikl\'os Z. Horv\'ath, Andrew Ferraiuolo, Henryk Michalewski, Edward Lockhart, Codrut Grosu, Thomas Hubert, Matej Balog, Pushmeet Kohli, Swarat Chaudhuri
arXiv AI
Sep 25

Learning to Discover Interesting Mathematics

The paper introduces a method for evaluating the intrinsic interestingness of mathematical theorems by comparing the length of their proofs to the length of their statements. It trains a 27B language model to predict proof difficulty, enabling the generation and selection of more interesting theorems while significantly reducing overlap with existing Mathlib. The approach allows iterative expansion of a self‑building, machine‑verified mathematical library guided by quantifiable metrics.

By Niket Patel, Ahmad Rammal, Amaury Hayat, Remi Munos, Julia Kempe
arXiv Machine Learning
Sep 3

Towards Solving the Gilbert-Pollak Conjecture via Large Language Models

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