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: Kirby Problem 3.57

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

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

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

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

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

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

Vibe Mathing single-problem candidate research: Kirby Problem 1.79

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

Vibe Mathing single-problem candidate research: Kirby Problem 2.22

Vibe Mathing single-problem candidate research: Progressions in Subsets of Z/NZ

Vibe Mathing single-problem candidate research: Packing T-joins

Vibe Mathing single-problem candidate research: Opposite vertices of base polyhedra

Vibe Mathing single-problem candidate research: Pollock's octahedral-number conjecture