Tag
This paper applies graph neural networks to predict the solvability of finite groups, demonstrating an AI-driven approach to a classic problem in group theory.
OpenAI claims its general-purpose reasoning model discovered a counterexample to the conjectured upper bound in Erdős's planar unit-distance problem, producing a proof reviewed by mathematicians.
Lean Refactor presents a retrieval-augmented agentic framework for multi-objective, controllable, and version-robust refactoring of Lean proofs, achieving significant compression and compilation-time reduction.