The Abbott-Hanson Recurrence for Schur Numbers
Prior state unknown→proved
improves the classical recurrence; the exact Schur numbers beyond S(5) remain unknown
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics / Ramsey theory
The Abbott-Hanson Recurrence for Schur Numbers
improves the classical recurrence; the exact Schur numbers beyond S(5) remain unknown
20Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
improves the classical recurrence; the exact Schur numbers beyond S(5) remain unknown
improves the classical recurrence; the exact Schur numbers beyond S(5) remain unknown
Recorded attempts
Evidence graph
Connected research record
- →improves the classical recurrence; the exact Schur numbers beyond S(5) remain unknown
parent of · claim · theorem
- →The Abbott-Hanson Recurrence for Schur Numbers
parent of · event · claim reported