A small website of precise open quantum problems to leverage AI
A Machine-Certified Proof of Frankl’s Conjecture via Collision-Restitution Invariants.
A high-performance C/AVX2 computational framework for exhaustively searching for counterexamples to the Beal Conjecture — pushing significantly deeper than previous published records.
A Machine-Verified Constructive Proof of Lemoine's Conjecture.
Computational evidence isolating the log(n) spreadness artifact in the Erdős k=3 Sunflower Conjecture via bitmask-accelerated Simulated Annealing.
A Boundary Analysis and Formal Proof by Contradiction of Vizing’s Conjecture in Lean 4 via the Impossibility of Minimal Counterexample Descent
Bounding Singmaster's Conjecture via Constructive Type Transformation in Lean 4.
This is Reinforcement Learning for Graph Theory (RLGT), a reinforcement learning framework that aims to facilitate future research in extremal graph theory.
A Lean 4 structural encoding of the Beal Conjecture using the 12-primitive Imscribing Grammar.
A Lean 4 self-modeling proof framework for the Perfect Cuboid problem, operating at the critical edge where algebra closes and descent begins
Semester project aiming at reproducing the results disproving the conjecture about the additivity of the unknotting number under connected sum, disproved Nov 2025 by Brittenham and Hermiller. The code implements a randomized search for "good" crossing changes.
The Iris Number System: a mechanical, countable definition of numbers, giving a uniquely reliable deduction framework for number theory, analysis, and more
Millennium Prize Problems
Add a description, image, and links to the conjecture-solving topic page so that developers can more easily learn about it.
To associate your repository with the conjecture-solving topic, visit your repo's landing page and select "manage topics."