AI agent makes progress on Conway's 99-graph problem

A new research paper details an autonomous AI agent's systematic attack on Conway's 99-graph problem, which questions the existence of a specific strongly regular graph. The AI agent provided verifiable contributions, including a proof that no circulant graph on Z/99 meets all constraints and a reduction of the problem to a smaller graph problem. The agent also developed a framework for checking automorphism orbit existence and achieved a verified artifact at 69.43% completion, suggesting this is a robust frontier for the problem. AI

IMPACT Demonstrates advanced AI capabilities in tackling complex mathematical and graph theory problems.

RANK_REASON The cluster contains a research paper detailing a novel approach to a mathematical problem using an AI agent. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

• AI research agent
• circulant graph
• Conway's 99-graph problem
• CP-SAT
• Paley graph
• srg(13,6,2,3)
• srg(9,4,1,2)
• strongly regular graph

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →