Skip to main navigation Skip to search Skip to main content

Large sets in finite fields are sumsets

  • Noga Alon*
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

Abstract

For a prime p, a subset S of Zp is a sumset if S = A + A for some A ⊂ Zp. Let f (p) denote the maximum integer so that every subset S ⊂ Zp of size at least p - f (p) is a sumset. The question of determining or estimating f (p) was raised by Green. He showed that for all sufficiently large p, f (p) ≥ frac(1, 9) log2 p and proved, with Gowers, that f (p) < c p2 / 3 log1 / 3 p for some absolute constant c. Here we improve these estimates, showing that there are two absolute positive constants c1, c2 so that for all sufficiently large p,c1 frac(sqrt(p), sqrt(log p)) ≤ f (p) < c2 frac(p2 / 3, log1 / 3 p) . The proofs combine probabilistic arguments with spectral techniques.

Original languageEnglish
Pages (from-to)110-118
Number of pages9
JournalJournal of Number Theory
Volume126
Issue number1
DOIs
StatePublished - Sep 2007

Funding

Funders
Hermann Minkowski Minerva Center for Geometry
USA–Israel BSF
Israel Science Foundation
Tel Aviv University

    Keywords

    • Cayley sum graph
    • Character sums
    • Graph eigenvalues
    • Probabilistic method
    • Sumset

    Fingerprint

    Dive into the research topics of 'Large sets in finite fields are sumsets'. Together they form a unique fingerprint.

    Cite this