Iterated sumsets and subsequence sums

From MaRDI portal



Abstract: Let GcongmathbbZ/m1mathbbZimesldotsimesmathbbZ/mrmathbbZ be a finite abelian group with m1midldotsmidmr=exp(G). The Kemperman Structure Theorem characterizes all subsets A,,BsubseteqG satisfying |A+B|<|A|+|B| and has been extended to cover the case when |A+B|leq|A|+|B|. Utilizing these results, we provide a precise structural description of all finite subsets AsubseteqG with |nA|leq(|A|+1)n−3 when ngeq3 (also when G is infinite), in which case many of the pathological possibilities from the case n=2 vanish, particularly for large ngeqexp(G)−1. The structural description is combined with other arguments to generalize a subsequence sum result of Olson asserting that a sequence S of terms from G having length |S|geq2|G|−1 must either have every element of G representable as a sum of |G|-terms from S or else have all but |G/H|−2 of its terms lying in a common H-coset for some HleqG. We show that the much weaker hypothesis |S|geq|G|+exp(G) suffices to obtain a nearly identical conclusion, where for the case H is trivial we must allow all but |G/H|−1 terms of S to be from the same H-coset. The bound on |S| is improved for several classes of groups G, yielding optimal lower bounds for |S|. We also generalize Olson's result for |G|-term subsums to an analogous one for n-term subsums when ngeqexp(G), with the bound likewise improved for several special classes of groups. This improves previous generalizations of Olson's result, with the bounds for n optimal.


Let \(G\) be an abelian group (finite or not) and let \(A\subseteq G\) be a finite set such that the difference set \(A-A = \{a_1-a_2 : a_1,a_2 \in A\}\) generates \(G\). Also, let \(n\ge 3\) be an integer, the sumset \(nA = \{ a_1+\dots+a_n : a_1,\dots, a_n \in A \}\) has zero stabilizer and \[ |nA| < (|A|+1)n - 3 \,.\tag{1} \] The paper is devoted to study the structure of sets satisfying (1) and the author gives a complete description of such sets. After that he applies this inverse result to generalize a theorem of \textit{J. E. Olson} [J. Number Theory 9, 63--70 (1977; Zbl 0351.20032)] which is in turn a refinement of the famous Erdős-Ginzburg-Ziv theorem [\textit{P. Erdős} et al., Bull. Res. Council Israel 10F, 41--43 (1961; Zbl 0063.00009)], in several directions. For example, consider a sequence \(S\) of some elements of \(G\), \(|S|\ge n+|G|-1\), where \(1\le n\) be the maximal multiplicity in the sequence \(S\). Suppose that for every proper subgroup \(H\) and \(\alpha \in G\) there are at least \(|G/H|-1\) terms of \(S\) lying outside the coset \(H+\alpha\). If \(n\ge \exp (G)\), then any element of \(G\) can be expressed as a sum of several elements of \(S\).











This page was built for publication: Iterated sumsets and subsequence sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671777)