The inverse Littlewood conjecture for structure of low-norm sets

From papers

Let AZA\subset\mathbb{Z} be a finite set of size NN, and let K>0K>0. Write 1A1_A for its indicator and define

1A^(θ)=nAe(nθ),e(x)=e2πix.\widehat{1_A}(\theta)=\sum_{n\in A}e(-n\theta),\qquad e(x)=e^{2\pi i x}.

A finite arithmetic progression is a finite subset of Z\mathbb{Z} with constant nonzero common difference. The inverse Littlewood conjecture. If

1A^1KlogN,\\|\widehat{1_A}\\|_1\leqslant K\log N,

then there are integers m,rK1m,r\ll_K1, finite arithmetic progressions P1,,PmZP_1,\ldots,P_m\subset\mathbb{Z} of length at most NN, finite sets X1,,XrZX_1,\ldots,X_r\subset\mathbb{Z} with

jXj=oK(N),\left|\bigcup_jX_j\right|=o_K(N),

and ϵ1,,ϵm,η1,,ηr1,1\epsilon_1,\ldots,\epsilon_m,\eta_1,\ldots,\eta_r\in\\{-1,1\\} such that

1A=1imϵi1Pi+1jrηj1Xj.1_A=\sum_{1\leqslant i\leqslant m}\epsilon_i1_{P_i}+\sum_{1\leqslant j\leqslant r}\eta_j1_{X_j}.

This is a proposed structural inverse theorem: it would describe every set with nearly minimal Fourier L1L^1 norm using boundedly many arithmetic progressions, up to a small exceptional union. No counterexample is known; analogous finite-field results are known, and the source notes a related, slightly stronger conjecture of Petridis. The conjecture would in particular imply that AA has dense intersection with an arithmetic progression of length at most NN.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Thomas F. Bloom and Ben Green, “Remarks on the inverse Littlewood conjecture”, arXiv:2602.16482 (2026).

Solutions 0

No solutions have been posted yet.