On Extending Pollard's Theorem for t-Representable Sums
David J. Grynkiewicz

TL;DR
This paper extends Pollard's theorem to t-representable sums in abelian groups, providing bounds on the sum of elements with multiple representations and characterizing near-extremal cases.
Contribution
It generalizes Pollard's theorem for t-representable sums, offering new bounds and structural insights for subsets in abelian groups.
Findings
Established lower bounds for sums of t-representable elements.
Characterized cases where bounds are nearly tight.
Improved bounds specifically for t=2 case.
Abstract
Let , let and be finite, nonempty subsets of an abelian group , and let denote all the elements with at least representations of the form , with and . For , 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 and 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 is the (nontrivial) stabilizer of and . In the case , we improve (\ref{almost}) to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · Logic, Reasoning, and Knowledge
