Extremal diameter conjecture for sumsets

Let AZA\subseteq\mathbb{Z} be a finite set, let A=k|A|=k, and write diam(A)=maxAminA=d\operatorname{diam}(A)=\max A-\min A=d. For hA={a1++ah:aiA}hA=\{a_1+\cdots+a_h:a_i\in A\}, extremal diameter conjecture. If hNh\in\mathbb{N} and k3k\geq 3, then

hAh([0,k2]{d}).|hA|\geq\left|h\bigl([0,k-2]\cup\{d\}\bigr)\right|.

The conjecture is presented as an extension of the preceding lemmas and is trivially tight if true. Nathanson gives an explicit computation of the right-hand side, and the conjecture would imply additional gaps in the possible-size set when h>k+1h>k+1; the source reports a related result for k=3k=3.

Sources & referencesView supporting material

Primary source

Isaac Rajagopal, “Possible Sizes of Sumsets”, arXiv:2510.23022 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.