▲ 51 r/mathpics
No-3-in-line problem solved for order 72 by Marijn Heule
In the No-3-in-line problem, no three points are in a line, in any direction or any slope.
"On 25th June 2026 Marijn Heule found a new solution with record grid size n=72 in the rot4 symmetry class."
u/EdPeggJr — 11 days ago
▲ 18 r/mathpics
A277433 Minimal no-3-in-line. 12 points suffice for order 14.
u/EdPeggJr — 14 days ago
No-3-in-line problem solved for order 70 by Marijn Heule
In the No-3-in-line problem, no three points are in a line, in any direction.
"On 17th June 2026 Marijn Heule of Carnegie Mellon University (Pittsburgh, Pennsylvania, USA) used a newly developed SAT (Boolean satisfiability) solver to find a solution for n=70 in the rot4 symmetry class."
u/EdPeggJr — 18 days ago
▲ 329 r/math
Graph Reconstruction Conjecture -- Google Deepmind solves 9 of 353 open Erdős problems
The Abstract: Large language models (LLMs) increasingly excel at mathematical reasoning, but their unreliability limits their utility in mathematics research. A mitigation is using LLMs to generate formal proofs in languages like Lean. We perform the first large-scale evaluation of this method’s ability to solve open problems. Our most capable agent autonomously resolved 9 of 353 open Erdős problems at the per-problem cost of a few hundred dollars, proved 44/492 OEIS conjectures, and is being deployed in combinatorics, optimization, graph theory, algebraic geometry, and quantum optics research. A basic agent alternating LLM-based generation with Lean-based verification replicated the Erdős successes but proved costlier on the hardest problems.
Link for the Reconstruction conjecture.
u/EdPeggJr — 1 month ago