English

On Extending Pollard's Theorem for t-Representable Sums

Number Theory 2008-03-19 v1 Combinatorics

Abstract

Let t1t\geq 1, let AA and BB be finite, nonempty subsets of an abelian group GG, and let A\ppiBA\pp{i} B denote all the elements cc with at least ii representations of the form c=a+bc=a+b, with aAa\in A and bBb\in B. For A,Bt|A|, |B|\geq t, we show that either \be\label{almost}\Sum{i=1}{t}|A\pp{i} B|\geq t|A|+t|B|-2t^2+1,\ee or else there exist AAA'\subseteq A and BBB'\subseteq B with \ber \nn l&:=&|A\setminus A'|+|B\setminus B'|\leq t-1, \nn A'\pp{t}B'&=&A'+B'=A\pp{t}B,{and} \nn \Sum{i=1}{t}|A\pp{i}B|&\geq& t|A|+t|B|-(t-l)(|H|-\rho)-tl\geq t|A|+t|B|-t|H|,\eer where HH is the (nontrivial) stabilizer of A\pptBA\pp{t} B and ρ=A+HA+B+HB\rho=|A'+H|-|A'|+|B'+H|-|B'|. In the case t=2t=2, we improve (\ref{almost}) to A\pp1B+A\pp2B2A+2B4|A\pp{1}B|+|A\pp{2}B|\geq 2|A|+2|B|-4.

Keywords

Cite

@article{arxiv.0803.2601,
  title  = {On Extending Pollard's Theorem for t-Representable Sums},
  author = {David J. Grynkiewicz},
  journal= {arXiv preprint arXiv:0803.2601},
  year   = {2008}
}
R2 v1 2026-06-21T10:22:23.440Z