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 language | English (US) |
|---|---|
| Pages (from-to) | 110-118 |
| Number of pages | 9 |
| Journal | Journal of Number Theory |
| Volume | 126 |
| Issue number | 1 |
| DOIs | |
| State | Published - Sep 2007 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver