An inverse theorem for the restricted set addition in Abelian groups. (Q2386056): Difference between revisions

Let \(A\) be a set of \(k\geq 5\) elements of an Abelian group \(G\) in which the order of the smallest nonzero subgroup is larger than \(2k-3\). It was previously shown by the author [Isr. J. Math 139, 349--359 (2004; Zbl 1082.11015)] that the number of different elements of \(G\) that can be written in the form \(a+a'\) where \(a,a'\in A\), \(a\neq a'\) is at least \(2k-3\). In this paper, the author proves that this bound is attained if and only if the elements of \(A\) form an arithmetic progression in \(G\). This completes the solution of a problem of \textit{P. Erdős} and \textit{H. Heilbronn} [Acta Arith. 9, 149--159 (1964; Zbl 0156.04801). The so-called 'Combinatorial Nullstellensatz' is used [\textit{N. Alon}, Comb. Probab. Comput. 8, No. 1-2, 7--29 (1999; Zbl 0920.05026)]. The problem was dealt with by several authors mainly in the last decade: Hamidoune, Rødseth, Freiman, Kemperman, Dias da Silva, Alon, Nathanson, Ruzsa, Lev, Lladó, Serra, Eliahon and Kervaire. The historical presentation and the statements of results cover three pages. The proofs cover 33 pages.