Ben Green
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Ben Green has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Imre Z. Ruzsa
Alfréd Rényi Institute of Mathematics
2 shared publications
Latest Publications
- 1 May 2005
- Published by Springer Nature in Combinatorica
- Vol. 25 (3) , 307-326
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs
- 1 May 2005
- Published by Springer Nature in Combinatorica
- Vol. 25 (3) , 307-326
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs
- Open Access
Sum-free sets in abelian groups
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a constant depending on G and lying in the interval [2/7,1/2]. We also estimate the number of sum-free subsets of G. It turns out that log_2 of this number is c(G)|G| + o(|G|), which is tight up to the o-term. For certain abelian groups, those whose order is divisible by a small prime of the form 3k + 2, we can obtain an asymptotic for the number of sum-free sets.
Open AccessSum-free sets in abelian groups
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a constant depending on G and lying in the interval [2/7,1/2]. We also estimate the number of sum-free subsets of G. It turns out that log_2 of this number is c(G)|G| + o(|G|), which is tight up to the o-term. For certain abelian groups, those whose order is divisible by a small prime of the form 3k + 2, we can obtain an asymptotic for the number of sum-free sets.
- Open Access
A Szemeredi-type regularity lemma in abelian groups, with applications
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some results in additive number theory. One is a structure theorm for sets which are almost sum-free. If A is a subset of [N] which contains just o(N^2) triples (x,y,z) such that x + y = z then A may be written as the union of B and C, where B is sum-free and |C| = o(N). Another answers a question of Bergelson, Host and Kra. If alpha, epsilon > 0, if N > N_0(alpha,epsilon) and if A is a subset of {1,...,N} of size alpha N, then there is some non-zero d such that A contains at least (alpha^3 - epsilon)N three-term arithmetic progressions with common difference d.
Open AccessA Szemeredi-type regularity lemma in abelian groups, with applications
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some results in additive number theory. One is a structure theorm for sets which are almost sum-free. If A is a subset of [N] which contains just o(N^2) triples (x,y,z) such that x + y = z then A may be written as the union of B and C, where B is sum-free and |C| = o(N). Another answers a question of Bergelson, Host and Kra. If alpha, epsilon > 0, if N > N_0(alpha,epsilon) and if A is a subset of {1,...,N} of size alpha N, then there is some non-zero d such that A contains at least (alpha^3 - epsilon)N three-term arithmetic progressions with common difference d.
- Open Access
Finite field models in additive combinatorics
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of finite field models of this type, which allows us to introduce some of the central ideas in additive combinatorics relatively cleanly. We also give an indication of how the intuition gained from the study of finite field models can be helpful for addressing the original questions.
Open AccessFinite field models in additive combinatorics
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of finite field models of this type, which allows us to introduce some of the central ideas in additive combinatorics relatively cleanly. We also give an indication of how the intuition gained from the study of finite field models can be helpful for addressing the original questions.
- Open Access
Roth's theorem in the primes
We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by giving a new proof of a rather more general result of Bourgain which, because of a close analogy with a classical argument of Tomas and Stein from Euclidean harmonic analysis, might be called a restriction theorem for the primes.
Open AccessRoth's theorem in the primes
We show that any set containing a positive proportion of the primes contains a 3-term arithmetic progression. An important ingredient is a proof that the primes enjoy the so-called Hardy-Littlewood majorant property. We derive this by giving a new proof of a rather more general result of Bourgain which, because of a close analogy with a classical argument of Tomas and Stein from Euclidean harmonic analysis, might be called a restriction theorem for the primes.
- 1 January 2004
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 41 (3) , 285-293
Counting sumsets and sum-free sets modulo a prime
Let p be a prime. A set A of residues modulo p is said to be sum-free if there are no solutions to a = a′ + a″ with a, a′, a″ ∈ A. We show that there are 2p/3+o(p) such sets. We also count the number of distinct sets of the form B + B, where B is a set of residues modulo p. Once again, there are 2p/3+o(p) such sets.
- 1 January 2004
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 41 (3) , 285-293
Counting sumsets and sum-free sets modulo a prime
Let p be a prime. A set A of residues modulo p is said to be sum-free if there are no solutions to a = a′ + a″ with a, a′, a″ ∈ A. We show that there are 2p/3+o(p) such sets. We also count the number of distinct sets of the form B + B, where B is a set of residues modulo p. Once again, there are 2p/3+o(p) such sets.
- Open Access
Counting sets with small sumset, and the clique number of random Cayley graphs
Given a set A in Z/NZ we may form a Cayley sum graph G_A on vertex set Z/NZ by joining i to j if and only if i + j is in A. We investigate the extent to which performing this construction with a random set A simulates the generation of a random graph, proving that the clique number of G_A is a.s. O(log N). This shows that Cayley sum graphs can furnish good examples of Ramsey graphs. To prove this result we must study the specific structure of set addition on Z/NZ. Indeed, we also show that the clique number of a random Cayley sum graph on (Z/2Z)^n, 2^n = N, is almost surely not O(log N). Despite the graph-theoretical title, this is a paper in number theory. Our main results are essentially estimates for the number of sets A in {1,...,N} with |A| = k and |A + A| = m, for various values of k and m.
Open AccessCounting sets with small sumset, and the clique number of random Cayley graphs
Given a set A in Z/NZ we may form a Cayley sum graph G_A on vertex set Z/NZ by joining i to j if and only if i + j is in A. We investigate the extent to which performing this construction with a random set A simulates the generation of a random graph, proving that the clique number of G_A is a.s. O(log N). This shows that Cayley sum graphs can furnish good examples of Ramsey graphs. To prove this result we must study the specific structure of set addition on Z/NZ. Indeed, we also show that the clique number of a random Cayley sum graph on (Z/2Z)^n, 2^n = N, is almost surely not O(log N). Despite the graph-theoretical title, this is a paper in number theory. Our main results are essentially estimates for the number of sets A in {1,...,N} with |A| = k and |A + A| = m, for various values of k and m.
- Open Access
The Cameron-Erdos Conjecture
A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).
Open AccessThe Cameron-Erdos Conjecture
A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).
- 17 March 2003
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 12 (2) , 127-138
Some Constructions in the Inverse Spectral Theory of Cyclic Groups
The results of this paper concern the ‘large spectra’ of sets, by which we mean the set of points in , a trivial consequence of Parseval's theorem.
- 17 March 2003
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 12 (2) , 127-138
Some Constructions in the Inverse Spectral Theory of Cyclic Groups
The results of this paper concern the ‘large spectra’ of sets, by which we mean the set of points in , a trivial consequence of Parseval's theorem.