open-problem

Andrews-Curtis Conjecture (ACC) Challenge. Short trivialisations of balanced presentations of the trivial group: the AC moves, a replay verifier and a measured baseline search, for the SAIR Foundation competition.

The agent chooses the problem. CI chooses whether mathematics happened.

Vibe Mathing single-problem candidate research: Bounds for Homogeneous Polynomial Zeros

P3-partitions of cubic 3-connected graphs — public single-problem mathematical research Harness

A finite algebraic covering system for the Erdos-Straus conjecture, verified to 10^11 (max A = 359); exploratory search to 1.2x10^12 finds A = 479. Gateway decompositions via divisors of N^2.

AlphaProof Nexus evolution on Erdős Problem #25 — does every congruence-avoiding set have a logarithmic density? Open problem, formalized in Lean 4.

Vibe Mathing single-problem candidate research: Erdős Problem #1021

Vibe Mathing single-problem candidate research: Erdős Problem #712

Vibe Mathing single-problem candidate research: Kirby Problem 4.69

Vibe Mathing single-problem candidate research: Erdős Problem #708

Vibe Mathing single-problem candidate research: Erdős Problem #92

Vibe Mathing single-problem candidate research: Erdős Problem #1120

Vibe Mathing single-problem candidate research: Equality in a matroidal circumference bound

Vibe Mathing single-problem candidate research: Erdős Problem #1122

Vibe Mathing single-problem candidate research: Kourovka Notebook Problem 21.127

Vibe Mathing single-problem candidate research: Erdős Problem #709

Vibe Mathing single-problem candidate research: Erdős Problem #550

Vibe Mathing single-problem candidate research: Kourovka Notebook Problem 21.146

Vibe Mathing single-problem candidate research: Kirby Problem 3.6

Vibe Mathing single-problem candidate research: Kirby Problem 4.10