Automated mathematical research: stronger bounds, exact answers and reusable proofs.
Illustration · a 2-coloring with no single-color edge
Property BHypergraph two-coloring
Exponentially growing gains for hypergraph coloring
Lower bounds on m(k)
k = 535
k = 667
k = 7131
k = 8267
k = 9543
k = 101112
k = 112275
k = 124664
Uniform theoremAn additive improvement over the stated RS baseline for every k≥12, with a gain that grows exponentially in k.
Why it matters Below each edge threshold, every k-uniform hypergraph has a coloring with both colors in every edge. The uniform theorem extends stronger guarantees to infinitely many k.
Method Combine constraints that must hold in the same hypergraph.
m(k) is the fewest edges of a finite simple k-uniform hypergraph that is not 2-colorable. End-to-end Lean proofs cover m(5) ≥ 33, 34 and the uniform k ≥ 12 theorem; m(5) ≥ 35 has a complete written proof with Lean formalization in progress, and k = 6–12 rest on parameter-specific computer-assisted proofs.
Exact d₂(n,k) values · hatched: still open
Error-correcting codesBinary linear code distances
Closing three code-distance gaps dating to 1985
d2(n,k): the largest minimum distance of a binary linear code of length n and dimension k
d2(43,10)=16
d2(44,10)=17
d2(44,11)=16
d2(42,16)=12†
16≤d2(45,11)≤17open
† Applies a published 2020 theorem.
Why it matters The main proof closes the first three gaps recorded in 1985. The fourth exact value, d₂(42,16)=12, follows from a published 2020 theorem; d₂(45,11) narrows to 16–17.
Method Reduce every candidate to a complete parent-code domain.
The first three follow from the original exclusion; 42/16 applies a published 2020 theorem. Lean reductions keep explicit literature, classification and computation premises. d₂(45,11) remains 16–17.
Illustration · Petersen graph, degree 3 and diameter 2
Degree–diameter problemLargest graphs
Our best constructions by setting
Latest project construction in each showcased setting.
D5 follow-up run: v4 + local updates → v5 main maintenance.
Why it matters More vertices under the same degree and diameter limits, with each setting retaining its own best construction.
D5 method Preserve the source for D12; bind the geometric core and check the boundary for D11.
Both D5 final graphs regenerate deterministically. D12 preserves the 42,402-vertex source and checks all 31 new vertices; D11 takes core–core distances from the H9 theorem under its stated σ/π identification and checks all 161 peripheral and new vertices. End-to-end Lean proofs and independent refereeing for these D5 graphs remain open. On the Comellas table checked 2026-11-16, (10,4) is 2,612 and (16,4) is 16,848, above our earlier constructions of 2,567 and 16,416.
Q₄ with one square (C₄) · density scale
Erdős Problem 86Square-free hypercube subgraphs
Finite and asymptotic bounds for C₄-free cubes
Subgraphs of Qn without C4: per-setting results
Q₇ (n = 7)304304-edge construction verified; 304 upper bound as reported in the source package, not re-verified in this pass.
Q₇: two explicit 304-edge C₄-free subgraphs verified in-repo; 304 upper bound as reported in the source package, not re-verified in this pass (21 raw .cnf/.drup traces omitted upstream). Q₈: four 682-edge constructions and C++17 13,150,453-completion replay verified; Theorem B uses 83 active cuts and 25 imported Q₆ DRAT certificates (reviewed in the same model family; independent refereeing pending), and ex(Q₈, C₄) ≤ 682 remains open. Q∞: T3 = 681653995482306581 / 1152921504606846976 ≤ 0.5912405943 and T4 = 9701859764505653085708308080340303 / 16409326186106551516455239680000000 ≤ 0.5912405942 (via a 5-line hypergeometric tower for all n ≥ 1024), both proved and rechecked in 128-bit C++20; exploratory 0.5907 is an approximate fit (residual ≈ 3.9 × 10⁻⁴), and an earlier 0.5899 claim was refuted and withdrawn.
Illustration · one matching (red) inside one Hamilton cycle of Q₆
Ruskey–Savage conjectureHamilton cycles in hypercubes
From Q₆ to dense Q₇ matchings
TheoremIn Q6, every matching extends to a Hamilton cycle.
CorollaryCombined with published results, for every n, any matching in Qn that uses at most six directions extends to a Hamilton cycle.
Why it matters Any set of disjoint edges in the six-dimensional cube can be included in one cycle visiting all 64 vertices. This settles the six-dimensional case; the general conjecture remains open.
Method A finite forest-rank certificate covers the universal matching family.
The checked replay rebuilds 1,024 forests and all 1,048,576 connectivity bits (rank 1,024), while the larger P6 certificate streams are inventoried rather than replayed here; reviewed in the same model family, with independent refereeing pending and no Lean formalization.
Why it matters Replayed CNF+DRAT and native-trace integer dual certificates tighten key signotope capacities and, via R7/R20 assembly, lower the working planar nonagon ceiling from 1508 (1501*) to 1148 alongside ES(7) ≤ 77.
Five finite suites are replayed directly in-repo: milestone9 N(8,6,6) ≤ 61 (115 shared-label rows + DRAT; the 9-hole hitting vector is a matrix witness, not a 61-point signotope), zero-float native-trace integer duals N(9,8,8) ≤ 688 and junction-restricted D₉ ≤ 458 (matching the 47,635-row depth-≤3 LP ceiling), Schroeder’s 15-file octagon omission trees (193 / 124), DRAT exclusion of 5 common m = 7 lock blocks, and the 25-point E21 abstract witness (with historical same-family/provisional acceptance of N(7,5,6) ≤ 25). Planar ES(8) ≤ 319 is Schroeder’s published preprint bound; all structural, cyclic-sign transfer (N(8,8,8) ≤ 318) and R7/R20 assembly manuscripts (ES(7) ≤ 77, ES(9) ≤ 1148) remain working proofs pending independent mathematical review, with no Lean formalization.
How a problem moves through MathRSI
Parallel agents develop proofs. Cross-model reviewers challenge them. New evidence returns to the right stage and becomes reusable research memory.
Problem
Recognize the domain
Load its plugin, or the shared base alone
Adaptive stages
Research wikiread before each obligation · write lemmas, counterexamples and failures · reuse in the next step
Does this reduction make the original problem easier?Global progress checks · v4 maintenance on main
At planned checkpoints—or when new local results leave the same bottleneck untouched—two independent agents reassess the whole problem. One checks what remains even if the current work succeeds; the other compares alternative routes and the total cost of finishing.
The coordinator then changes the next task: connect a missing proof step, change the representation, switch routes, assemble a sufficient result, or continue within a concrete budget. Necessary complete calculations retain their completion plan.