On the number of sums and differences (Q1206296)

Let \(A\subseteq\mathbb{Z}\). All sums of \(A+A=\{a+b:a,b\in A,a\geq b\}\) are different if and only if the same is true for all differences \(\neq 0\) of \(A-A=\{a-b:a,b\in A\}\). But there are sets \(A\) such that almost all sums are represented multiply while almost all differences are different, and conversely. Using probability methods it is shown that for every \(n>n_ 0\) there are sets \(A,B\subseteq\mathbb{Z}\), \(| A|=| B|=n\) such that \(| A+A|\leq n^{2-c}\) but \(| A-A|\geq n^ 2-n^{2- c}\) and \(| B-B|\leq n^{2-c}\) but \(| B+B|\geq{1\over 2}n^ 2-n^{2-c}\), where \(c>0\) does not depend on \(n\).