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.

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

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

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 #1055

Vibe Mathing single-problem candidate research: Negative association in uniform forests

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

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

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

Vibe Mathing single-problem candidate research: Sum of Cubes in F_3^n

Vibe Mathing single-problem candidate research: Kirby Problem 3.54

Vibe Mathing single-problem candidate research: Kirby Problem 4.71

Vibe Mathing single-problem candidate research: Ultimate Core Model

Vibe Mathing single-problem candidate research: Maximum Givens in Minimal Sudoku

Vibe Mathing single-problem candidate research: Existence of Perfect Cuboids

Vibe Mathing single-problem candidate research: Kirby Problem 4.67

Vibe Mathing single-problem candidate research: Octal Games Periodicity

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