combinatorics / Additive combinatorics

Ben Green's Open Problem 90

For $A \subset \mathbb{F}_p$ of density $1/2$, call $A$ almost affine invariant under $\varphi(x) = ax+b$ if $|A \triangle \varphi(A)| = o(p)$. Problem 90 asks for the threshold $K$ below which $A$ can be almost affine invariant simultaneously under all such $\varphi$ with $|a|, |b| \le K$ and $a \ne 0$. The threshold is $K = o(\log p)$.

30Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsMay 13, 2026Significance 30/100Registry: unreviewed

Ben Green's Open Problem 90

Prior state unknownproved

For $A \subset \mathbb{F}_p$ of density $1/2$, call $A$ almost affine invariant under $\varphi(x) = ax+b$ if $|A \triangle \varphi(A)| = o(p)$. Problem 90 asks for the threshold $K$ below which $A$ can be almost affine invariant simultaneously under all such $\varphi$ with $|a|, |b| \le K$ and $a \ne 0$. The threshold is $K = o(\log p)$.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

For $A \subset \mathbb{F}_p$ of density $1/2$, call $A$ almost affine invariant under $\varphi(x) = ax+b$ if $|A \triangle \varphi(A)| = o(p)$. Problem 90 asks for the threshold $K$ below which $A$ can be almost affine invariant simultaneously under all such $\varphi$ with $|a|, |b| \le K$ and $a \ne 0$. The threshold is $K = o(\log p)$.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.