3 papers
math.NT2026
An exact formula for Erdős' problem 1005
Yanmohan Wang, Mingxu Xie, Ziyuan Zhao
In 1943, Erdős considered the minimum number of terms between two fractions in the Farey sequence of order whose numerators and denominators are oppositely ordered. Dete…
math.CO2026
Average Local Independence and the Spanning-Tree Leaf Number: A Proof of Graffiti.pc Conjecture 2
Yanmohan Wang, Tianyue Dai, Rui Tong
We prove Graffiti.pc Conjecture 2, a 1996 conjecture listed as open on the \emph{Written on the Wall II} page marked ``Last update 7/23/26.'' Let be a finite simple connected g…
cs.LG2026
MaxProof: Scaling Mathematical Proof with Generative-Verifier RL and Population-Level Test-Time Scaling
Jiacheng Chen, Xinyu Zhang, Shunkai Zhang +20
We present MaxProof, a population-level test-time scaling framework for competition-level mathematical proof in the MiniMax-M3 series. M3 first trains three proof-oriented capabili…