Iterated Sumsets and Subsequence Sums

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The Kemperman Structure Theorem characterizes all subsets $A,\,B\subseteq G$ 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 $A\subseteq G$ with $|nA|\leq (|A|+1)n-3$ when $n\geq 3$ (also when $G$ is infinite), in which case many of the pathological possibilities from the case $n=2$ vanish, particularly for large $n\geq \exp(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|\geq 2|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 $H\leq G$. 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 $n\geq \exp(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.Comment: Revised version, with results reworded to appear less technica

On a Conjecture of Hamidoune for Subsequence Sums

Let G be an abelian group of order m, let S be a sequence of terms from G with k distinct terms, let m ∧ S denote the set of all elements that are a sum of some m-term subsequence of S, and let |S| be the length of S. We show that if |S| ≥ m + 1, and if the multiplicity of each term of S is at most m − k + 2, then either |m ∧ S| ≥ min{m, |S| − m + k − 1}, or there exists a proper, nontrivial subgroup Ha of index a, such that m ∧ S is a union of Ha-cosets, Ha ⊆ m ∧ S, and all but e terms of S are from the same Ha-coset, where e ≤ min{|S|−m+k−2 |Ha| − 1, a − 2} and |m ∧ S| ≥ (e + 1)|Ha|. This confirms a conjecture of Y. O. Hamidoune

Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter

Let m be a positive integer whose smallest prime divisor is denoted by p, and let Zm denote the cyclic group of residues modulo m. For a set B = {x1, x2, ..., xm} of m integers satisfying x1 {0, 1} (every coloring Delta : {1, ..., N} -> Zm), there exist two m-sets [see Abstract in the PDF]

The Large Davenport Constant I: Groups with a Cyclic, Index 2 Subgroup

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity element of $G$. The small Davenport constant $\mathsf d (G)$ is the maximal integer $\ell$ such that there is a sequence over $G$ of length $\ell$ which has no nontrivial, product-one subsequence. The large Davenport constant $\mathsf D (G)$ is the maximal length of a minimal product-one sequence---this is a product-one sequence which cannot be factored into two nontrivial, product-one subsequences. It is easily observed that $\mathsf d(G)+1\leq \mathsf D(G)$, and if $G$ is abelian, then equality holds. However, for non-abelian groups, these constants can differ significantly. Now suppose $G$ has a cyclic, index 2 subgroup. Then an old result of Olson and White (dating back to 1977) implies that $\mathsf d(G)=\frac12|G|$ if $G$ is non-cyclic, and $\mathsf d(G)=|G|-1$ if $G$ is cyclic. In this paper, we determine the large Davenport constant of such groups, showing that $\mathsf D(G)=\mathsf d(G)+|G'|$, where $G'=[G,G]\leq G$ is the commutator subgroup of $G$

Arithmetic-Progression-Weighted Subsequence Sums

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i {a term of} W,\, w_i\neq w_j{for} i\neq j\},$$ which is a particular kind of weighted restricted sumset. We show that $|W\odot S|\geq \min\{|G|-1,\,n\}$, that $W\odot S=G$ if $n\geq |G|+1$, and also characterize all sequences $S$ of length $|G|$ with $W\odot S\neq G$. This result then allows us to characterize when a linear equation $$a_1x_1+...+a_rx_r\equiv \alpha\mod n,$$ where $\alpha,a_1,..., a_r\in \Z$ are given, has a solution $(x_1,...,x_r)\in \Z^r$ modulo $n$ with all $x_i$ distinct modulo $n$. As a second simple corollary, we also show that there are maximal length minimal zero-sum sequences over a rank 2 finite abelian group $G\cong C_{n_1}\oplus C_{n_2}$ (where $n_1\mid n_2$ and $n_2\geq 3$) having $k$ distinct terms, for any $k\in [3,\min\{n_1+1,\,\exp(G)\}]$. Indeed, apart from a few simple restrictions, any pattern of multiplicities is realizable for such a maximal length minimal zero-sum sequence