Reproduce “A SAT-based Resolution of Lam's Problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas, Vijay Ganesh
A SAT-based resolution of Lam's problem confirms the nonexistence of a projective plane of order ten, specifically by proving the nonexistence of primitive weight 19 codewords. The work provides machine-verifiable nonexistence certificates and identified discrepancies in prior computational enumerations of subproblem solutions.
Key insights
- The SAT-based approach significantly enhanced the verifiability of the computational proof by producing standard, machine-checkable nonexistence certificates, addressing a major limitation of prior custom-code methods.
- The search uncovered inconsistencies in the number of A2 solutions reported by both the original 1989 search and its 2011 verification, highlighting the value of robust SAT solvers and certificate generation.
- The work completed a comprehensive SAT-based resolution of Lam's problem by resolving the most challenging primitive weight 19 case, laying groundwork for potential future formal proofs.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.