← All problems

Extremal diameter conjecture for sumsets

1 year old · traced to

Let A⊆ZA\subseteq\mathbb{Z} be a finite set, let ∣A∣=k|A|=k, and write diam⁡(A)=max⁡A−min⁡A=d\operatorname{diam}(A)=\max A-\min A=d. For hA={a1+⋯+ah:ai∈A}hA=\{a_1+\cdots+a_h:a_i\in A\}, extremal diameter conjecture. If h∈Nh\in\mathbb{N} and k≥3k\geq 3, then

∣hA∣≥∣h([0,k−2]∪{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.

References
  1. 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.