Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kneser-Type Generalization of Pollard's Theorem

Updated 1 February 2026
  • The paper extends Pollard's theorem to arbitrary abelian groups by establishing sharp quadratic lower bounds on popular sumsets.
  • It employs additive combinatorial tools such as the Dyson transform and Kneser’s inequalities to derive precise structural characterizations.
  • The work refines previous bounds by replacing a -2t² term with a -4t²/3 adjustment, closely approaching the ideal t² threshold in cyclic groups.

The Kneser-type generalization of Pollard’s theorem studies sumset structures in abelian groups and establishes sharp lower bounds on the size of popular sumsets—those elements that can be written multiple times as a sum of elements from two finite sets. Building upon classical results by Kneser for ordinary sumsets and Pollard for popular sumsets in cyclic groups, recent work provides refined quadratic term bounds and structural characterizations for general abelian groups, leveraging techniques from additive combinatorics including the pigeonhole principle, Kneser’s inequalities, and the Dyson transform induction (Grynkiewicz et al., 25 Jan 2026).

1. Fundamental Notions and Key Definitions

Let (G,+)(G,+) be an abelian group, and A,BGA,B\subseteq G be finite subsets. The ordinary sumset is defined as

A+B:={a+b:aA,bB}.A+B := \{ a+b : a\in A,\, b\in B \}.

For gGg\in G, the number of representations of gg as a sum a+ba+b with aAa\in A, bBb\in B is

rA,B(g):={(a,b)A×B:a+b=g}.\mathsf{r}_{A,B}(g) := |\{ (a,b)\in A\times B : a+b = g \}|.

For a positive integer tt, the tt-popular sumset is

A+tB:={gG:rA,B(g)t}.A+_t B := \{ g\in G : \mathsf{r}_{A,B}(g)\ge t \}.

In particular, A+1B=A+BA+_1B = A+B. For any subset XGX\subseteq G, its stabilizer (or period) is the subgroup

H(X):={hG:h+X=X}G.\mathsf{H}(X) := \{ h\in G : h + X = X \} \le G.

If H(X)>1|\mathsf{H}(X)|>1, XX is periodic; otherwise, aperiodic. For the remainder, let H:=H(A+tB)H := \mathsf{H}(A+_tB).

2. Main Theorem and Structural Consequences

The central result, achieved by Grynkiewicz and Wang, extends Pollard’s theorem to arbitrary abelian groups and improves upon previous quadratic lower bounds for the total cardinality of popular sumsets. Given t2t \ge 2 and finite subsets A,BGA,B\subseteq G with A,Bt|A|, |B| \ge t, if

i=1tA+iB<tA+tB43t2+23t,\sum_{i=1}^t |A+_iB| < t|A| + t|B| - \frac{4}{3} t^2 + \frac{2}{3} t,

then there exist subsets AAA'\subseteq A and BBB'\subseteq B such that:

  • AA+BBt1|A\setminus A'| + |B\setminus B'| \le t-1,
  • A+tB=A+B=A+tBA'+_tB' = A'+B' = A+_tB,
  • i=1tA+iBtA+tBtH\sum_{i=1}^t |A+_iB| \ge t|A| + t|B| - t|H|.

Additionally, A,Bt+1|A'|,|B'|\ge t+1 and A+B<A+Bt|A'+B'|<|A'| + |B'| - t. This result refines the best known quadratic term from 2t2-2t^2 to 43t2-\frac{4}{3}t^2, approaching the “ideal” t2-t^2 threshold achieved for cyclic groups (Grynkiewicz et al., 25 Jan 2026).

3. Proof Techniques and Underlying Additive-Combinatorial Tools

The proof employs several key ideas from additive combinatorics:

  • Pigeonhole Principle: Using the bound rA,B(g)A+BG\mathsf{r}_{A,B}(g)\ge |A| + |B| - |G|.
  • Kneser’s Inequality: For sumsets, A+BA+BH(A+B)|A+B| \ge |A| + |B| - |\mathsf{H}(A+B)|.
  • Structural Proposition (Cleanup Lemma): If A,BA', B' already have A+tB=A+tBA'+_tB'=A+_tB and the difference AA+BBt1|A\setminus A'| + |B\setminus B'| \le t-1, one can replace them with slightly larger HH-periodic sets A,BA'', B'' with

A+B<A+B(1+α)t|A''+B''| < |A''| + |B''| - (1+\alpha)t

for α0\alpha\ge 0, and an improved sum of popular sumset sizes.

  • Dyson Transform Induction: The central inductive tool iterates on the lexicographically ordered quadruple

(t,i=1tA+iB,(A+B),min{A,B}).\left(t,\,\sum_{i=1}^t|A+_iB|,\,-(|A|+|B|),\,\min\{|A|,|B|\}\right).

For a well-chosen zABz\in A-B, it replaces

AA(z+B),BA(z+B),A \mapsto A \cup (z+B),\quad B \mapsto A \cap (z+B),

reducing the sum i=1tA+iB\sum_{i=1}^t|A+_iB| while preserving A+B|A| + |B|.

Prior results used the quadratic bound 2t2-2t^2 at three stages; this new argument tightens all three to achieve 43t2-\frac{4}{3}t^2.

4. Relation to Classical Results and Recent Progress

The progression and interrelations among fundamental results in sumset theory are summarized in the following table:

Theorem General Group Popular Sums Bound
Pollard (1974) Cyclic (CpC_p) min{tp,tA+tBt2}\geq \min\{tp,\, t|A|+t|B|-t^2\}
Kneser (1955) Abelian A+BA+BH|A+B| \geq |A|+|B|-|H|
Hamidoune–Serra (2008) Abelian tA+tBt214H2\geq t|A|+t|B|-t^2 - \frac14|H|^2
Grynkiewicz (2010) Abelian A+iB<tA+tB2t2+3t2\sum |A+_iB| < t|A|+t|B|-2t^2+3t-2
Grynkiewicz–Wang (2026) Abelian 43t2+23t-\frac{4}{3} t^2 + \frac{2}{3} t

For t=2t=2, the result coincides with the classical t2-t^2 bound, providing a full analog of Pollard’s theorem for any abelian group. In cyclic groups (G=CpG=C_p), the lower bound reduces exactly to Pollard’s tA+tBt2t|A|+t|B|-t^2, and is sharp up to structural conditions.

5. Examples and Illustrative Cases

A notable instance is t=2t=2. The hypothesis simplifies to

A+1B+A+2B<2A+2B3,|A+_1B| + |A+_2B| < 2|A| + 2|B| - 3,

and the quadratic term matches t2=4-t^2 = -4 for t=2t=2. The conclusion ensures that, after removing at most one element in total from AA or BB, the $2$-popular sumset becomes an ordinary sumset of “almost-full” sets.

For G=CpG=C_p, the result recovers Pollard’s original bound, since H{1,p}|H|\in\{1,p\}, and the structural conclusion becomes vacuous when H=CpH=C_p as A+B=GA'+B' = G.

6. Open Directions and Conjectures

The ultimate objective is to establish a unified generalization achieving the “ideal” hypothesis

i=1tA+iB<tA+tBt2\sum_{i=1}^t|A+_iB| < t|A| + t|B| - t^2

which would enforce strong HH-periodic structure and yield the lower bound

i=1tA+iBtA+tBtH.\sum_{i=1}^t|A+_iB| \ge t|A| + t|B| - t|H|.

Grynkiewicz–Wang conjecture a refinement using the Euclidean division t=sH+ut = s|H| + u, 0s0\leq s, 1uH1\leq u \leq |H|, to potentially prove

i=1tA+iBtA+tBt2u(Hu),\sum_{i=1}^t|A+_iB| \ge t|A| + t|B| - t^2 - u(|H| - u),

encompassing both the current bound and the one of Hamidoune–Serra in the regime H<t|H| < t. The structural description matching this numerology remains open for t3t \geq 3.

7. References and Foundational Literature

The main developments and proofs are presented in:

  • D. J. Grynkiewicz, Structural Additive Theory, Springer (2013), Chapter 12.
  • Y.-O. Hamidoune and O. Serra, "A note on Pollard’s theorem," (0804.2593) (2008).
  • J. M. Pollard, "A generalisation of the theorem of Cauchy and Davenport", J. London Math. Soc. 8 (1974), 460–462.
  • M. Kneser, "Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen", Math. Z. 61 (1955), 429–434.
  • Recent progress and further elaboration in (Grynkiewicz et al., 25 Jan 2026).
Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Kneser-Type Generalization of Pollard's Theorem.