Table of Contents
Fetching ...

Pollard's theorem in general abelian groups

David J. Grynkiewicz, Runze Wang

TL;DR

This work advances a Kneser-type generalization of Pollard's Theorem to general abelian groups by analyzing the $t$-popular sumset $A+_t B$ and proving a structural result under a refined bound. The authors establish that if $\sum_{i=1}^t |A+_i B|$ falls below a specific threshold, there exist near-identity removals $A'\subseteq A$, $B'\subseteq B$ with $A'+_t B'=A'+B'=A+_t B$ and a lower bound controlled by the stabilizer $H=\mathsf H(A'+B')$, thereby improving the quadratic term from $-2t^2$ to $-\frac{4}{3}t^2$. The main result strengthens prior partial results (e.g., Hamidoune–Serra, Grynkiewicz) and yields a fully explicit conclusion for $t=2$, while outlining the limit of current techniques for larger $t$. The paper also demonstrates an application to restricted sumsets, obtaining new lower bounds for $|A\overset{\tau}{+} B|$ in terms of the group order and the sizes of $A$ and $B$, thus contributing to the broader program of unifying Pollard-type and Kneser-type phenomena in abelian groups.

Abstract

We make further progress towards a Kneser-type generalization of Pollard's Theorem to general abelian groups. For two sets $A$ and $B$ in an abelian group $G$, the \emph{$t$-popular sumset} of $A$ and $B$, denoted by $A+_t B$, is the set of elements in $G$ each with at least $t$ representations of the form $a+b$, where $a\in A$ and $b\in B$. For $|A|,\, |B|\ge t\geq 2$, we prove that if \begin{align*} \sum_{i=1}^t |A+_i B|< t|A|+t|B|-\frac{4}{3}t^2+\frac{2}{3}t, \end{align*} then there exist $A'\subseteq A$ and $B'\subseteq B$ with $|A\setminus A'|+|B\setminus B'|\le t-1$, $A'+_t B'=A'+B'=A+_t B$, and $ \sum_{i=1}^t |A+_i B|\ge t|A|+t|B|-t|H|,$ where $H$ is the stabilizer of $A'+B'=A+_t B$. Our result improves the main quadratic term in the previous best bound from $-2t^2$ to $-\frac{4}{3}t^2$.

Pollard's theorem in general abelian groups

TL;DR

This work advances a Kneser-type generalization of Pollard's Theorem to general abelian groups by analyzing the -popular sumset and proving a structural result under a refined bound. The authors establish that if falls below a specific threshold, there exist near-identity removals , with and a lower bound controlled by the stabilizer , thereby improving the quadratic term from to . The main result strengthens prior partial results (e.g., Hamidoune–Serra, Grynkiewicz) and yields a fully explicit conclusion for , while outlining the limit of current techniques for larger . The paper also demonstrates an application to restricted sumsets, obtaining new lower bounds for in terms of the group order and the sizes of and , thus contributing to the broader program of unifying Pollard-type and Kneser-type phenomena in abelian groups.

Abstract

We make further progress towards a Kneser-type generalization of Pollard's Theorem to general abelian groups. For two sets and in an abelian group , the \emph{-popular sumset} of and , denoted by , is the set of elements in each with at least representations of the form , where and . For , we prove that if \begin{align*} \sum_{i=1}^t |A+_i B|< t|A|+t|B|-\frac{4}{3}t^2+\frac{2}{3}t, \end{align*} then there exist and with , , and where is the stabilizer of . Our result improves the main quadratic term in the previous best bound from to .
Paper Structure (7 sections, 11 theorems, 117 equations, 3 figures)

This paper contains 7 sections, 11 theorems, 117 equations, 3 figures.

Key Result

Proposition 1.1

Let $G$ be an abelian group, and let $A,\, B\subseteq G$ be finite subsets. Then $\mathsf r_{A,\,B}(g)\ge |A|+|B|-|G|$ for any $g\in G$.

Figures (3)

  • Figure 1: An $|A+B|\times |B|$ dot grid.
  • Figure 2: The number of holes in the red dashed rectangle is denoted by $y$.
  • Figure 3: The number of dots in the purple dashed rectangle is $|E|$.

Theorems & Definitions (24)

  • Proposition 1.1: Pigeonhole Bound Gry2
  • Theorem 1.2: Cauchy-Davenport Theorem CauDavGry2
  • Theorem 1.3: Kneser's Theorem Kne2Gry2
  • Proposition 1.4: Gry2
  • Theorem 1.5: Pollard's Theorem PolGry2
  • Theorem 1.6: Hamidoune and Serra HSGry2
  • Theorem 1.7: Grynkiewicz Gry2
  • Theorem 1.8
  • Proposition 2.1: Grynkiewicz Gry2
  • proof : Proof of Theorem \ref{['new']}
  • ...and 14 more