Improved Bound for Colorings Without Symmetrically Colored k-APs

Improves the exponent rather than answering the asked question: whether an $N^{o(1)}$ colouring exists remains open.

10Significance / 100

1Frontier events

0Verification tasks

0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

combinatoricsJul 22, 2026Significance 10/100Registry: unreviewed

Prior state unknown→proved

Improves the exponent rather than answering the asked question: whether an $N^{o(1)}$ colouring exists remains open.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Source authenticated

Improves the exponent rather than answering the asked question: whether an $N^{o(1)}$ colouring exists remains open.

Improves the exponent rather than answering the asked question: whether an $N^{o(1)}$ colouring exists remains open.

Evidence graph