Disk covering problem (disc covering): global optimality proof claims for n = 11-20, exact certificates, Chinese proofs, and reproducible verification code. External review pending.
Open-source re-implementation of DeepMind's unstable singularity detection methods using PINNs for blow-up solutions in fluid dynamics
正十七边形 12 E 尺规作图研究 | Regular 17-gon construction: verified 12 E upper bound, exact replay, and Manim animation.
Audit the declarations a computational result carries, and check they are still true. Producer freshness, counter coherence, provenance pins, partial runs. Read-only by construction.
Certified analytic geometry on an explicit K3 surface: a finite holomorphic atlas whose chart domains, transitions and branch continuations are machine-checked rather than asserted. Sixty chart types, exact transitions over Q, outward-rounded arithmetic elsewhere. No Ricci-flat metric claimed. One command checks nine of the fourteen certificates.
Rigorous bounds and reproducible certificates for covering the unit disk with 100 equal disks, with constructions, local results and failed routes; the global optimum remains open.
Dimers on the square lattice and the king's graph: the entropy per site of king's graph dimers (s = 0.5655119110413253 ± 6e-16, with rigorous bounds) and exact domino (OEIS A004003) and domicule (A239273) counts to 20×20, with papers, data and notebooks.
Proof claims and reproducible verification for the r=5,6,7,8 cases of Erdős Problem 617.
Certified computations on the Bolza surface: a computer-assisted (conditional) proof that it is a strict local maximum of lambda_1, an independent certificate checker, and repeated-eigenvalue sensitivity tools
Rigorous partial progress toward a global 68.10% PairCeiling certificate
Complete reproducible working-proof chain and exact verification materials for Dittert’s conjecture (all dimensions; under review)
Computer-assisted proof that the minimal superpermutation on six symbols has length 872. Machine-checked evidence ledger, adversarial audits, 15-second verification path. Preliminary.
An adversarial, fully-banked search for a Navier-Stokes blow-up certificate: 440 legs, no solution found, and an honest record of why. Every claim tiered, every gate falsifiable, all data banked. Independently kernel-checked the Lean Navier-Stokes formalisation. MIT + CC BY - fork it and carry on.
Exact tensor-product and commuting-operator I3322 quantum supremum with finite-dimensional nonattainment and independently replayable certificates.
Research notes, exact computations, and reproducible verification for MathOverflow 413935
Computer-assisted proofs and clean-room audits for the r=10 and r=11 fixed cases of Erdős Problem 617.
Exact verification code and certificates for phase transitions in generalized Damascus inequality violation sets.
Proofs, finite certificates, and reproducible SAT/XOR records for crossing-maximal complete-graph drawings.
Certificate, proof and two independent Arb checkers for C82 < 0.2534449 (essential minimum of the Zhang-Zagier height, Tao's optimization-constants table 82a)
Counterexample family for finite grand couplings with reproducible computer-assisted state minimality
To associate your repository with the computer-assisted-proof topic, visit your repo's landing page and select "manage topics."