Open problems in additive combinatorics

By Ernie Croot, Vsevolod F. Lev. 2007

70 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/bd326475f4632e4a73a3c0ea113bb4c8c284d828

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Noga Alon
2. Ian M. Wanless
3. Svante Janson
4. Roman Karasev
5. F. Petrov

In Discrete Mathematics and Combinatorics

1. Noga Alon

In Electrical and Electronic Engineering

1. Noga Alon

Citations in the corpus

• Large sets in finite fields are sumsets (2007, background): “To see this, note that S = Zp { 0,1} is A+A for A = {1,2,..., p 1 2 }, and every set of size p 2 is an ane image of this S. Ben Green (see [5], [ 4 ]) showed that if p is large then every subset”