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.

Literature-first, reproducible Mathematics Commons workbench for the Erdős–Straus conjecture

Vibe Mathing single-problem candidate research: Degree diameter problem

Vibe Mathing single-problem candidate research: Connelly’s blooming conjecture

Vibe Mathing single-problem candidate research: Are there infinitely many perfect numbers ?

Vibe Mathing single-problem candidate research: Woodall primes

Vibe Mathing single-problem candidate research: Waring's problem

Vibe Mathing single-problem candidate research: Gillies' conjecture

Vibe Mathing single-problem candidate research: prime triplets

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

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

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

Vibe Mathing single-problem candidate research: Partitionning a tournament into k-strongly connected subtournaments.

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

Vibe Mathing single-problem candidate research: Cube-Simplex conjecture