Lev–Freiman conjecture for restricted sumsets

From papers

Let AA be a set of k>7k>7 integers such that A[0,l]A\subseteq [0,l], 0,lA0,l\in A, and gcd(A)=1\gcd(A)=1. The restricted sumset is

2A=a+a:a,aA,aa.2^{\wedge}A=\\{a+a':a,a'\in A,\\ a\ne a'\\}.

Lev–Freiman conjecture. One has

|2^{\wedge}A|\geqslant \left\\{\begin{array}{ll} l+k-2 &\text{ if } l\leqslant 2k-5, \\\\ 3k-7 &\text{ if } l\geqslant 2k-4. \end{array}\right.

This conjecture was remarked by V. F. Lev in personal communication with G. A. Freiman as the restricted-sumset analogue of Freiman's 2A2A theorem. Its resolution status is not specified in the supplied source context.

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

Yujie Wang and Min Tang, “Restricted sumsets in Z”, arXiv:2402.01471 (2024).

Solutions 0

No solutions have been posted yet.