Ben Green

Orcid: 0000-0002-2224-1193

Affiliations:
  • Radcliffe Observatory Quarter, Mathematical Institute, Oxford, UK


According to our database1, Ben Green authored at least 15 papers between 2003 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Extremal problems for GCDs.
Comb. Probab. Comput., 2021

2019
On the arithmetic Kakeya conjecture of Katz and Tao.
Period. Math. Hung., 2019

2017
On the Chromatic Number of Random Cayley Graphs.
Comb. Probab. Comput., 2017

2016
Counting sets with small sumset and applications.
Comb., 2016

2015
The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk).
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2013
A nilpotent Freiman dimension lemma.
Eur. J. Comb., 2013

Contractions and expansion.
Eur. J. Comb., 2013

On Sets Defining Few Ordinary Lines.
Discret. Comput. Geom., 2013

2012
On (Not) Computing the Möbius Function Using Bounded Depth Circuits.
Comb. Probab. Comput., 2012

2009
Freiman's Theorem in Finite Fields via Extremal Set Theory.
Comb. Probab. Comput., 2009

The distribution of polynomials over finite fields, with applications to the Gowers norms.
Contributions Discret. Math., 2009

2007
Szemerédi's Theorem.
Scholarpedia, 2007

2005
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs.
Comb., 2005

Finite field models in additive combinatories.
Proceedings of the Surveys in Combinatorics, 2005

2003
Some Constructions In The Inverse Spectral Theory Of Cyclic Groups.
Comb. Probab. Comput., 2003


  Loading...