Optimally small sumsets in finite abelian groups

  • Shalom Eliahou
  • , Michel Kervaire
  • , Alain Plagne

Research output: Contribution to journalArticlepeer-review

Abstract

Let G be a finite abelian group of order g. We determine, for all 1 ≤r,s≤g, the minimal size μG(r,s) = min A + B of sumsets A + B, where A and B range over all subsets of G of cardinality r and s, respectively. We do so by explicit construction. Our formula for μG(r,s) shows that this function only depends on the cardinality of G, not on its specific group structure. Earlier results on μG are recalled in the Introduction.

Original languageEnglish
Pages (from-to)338-348
Number of pages11
JournalJournal of Number Theory
Volume101
Issue number2
DOIs
Publication statusPublished - 1 Aug 2003

Keywords

  • Additive number theory
  • Cauchy-Davenport theorem
  • Initial segment
  • Kneser theorem
  • Sumset

Fingerprint

Dive into the research topics of 'Optimally small sumsets in finite abelian groups'. Together they form a unique fingerprint.

Cite this