Ben Green (mathematician)

Last updated

Ben Green
Ben Green.jpg
Green in 2010
Born
Ben Joseph Green

(1977-02-27) 27 February 1977 (age 47)
Bristol, England
Alma mater Trinity College, Cambridge
(BA, MMath, PhD)
Awards Clay Research Award (2004)
Salem Prize (2005)
Whitehead Prize (2005)
SASTRA Ramanujan Prize (2007)
EMS Prize (2008)
Fellow of the Royal Society (2010)
Sylvester Medal (2014)
Senior Whitehead Prize (2019)
Scientific career
FieldsMathematics
Institutions University of Bristol
University of Cambridge
University of Oxford
Princeton University
University of British Columbia
Massachusetts Institute of Technology
Thesis Topics in Arithmetic Combinatorics  (2003)
Doctoral advisor Timothy Gowers
Doctoral students

Ben Joseph Green FRS (born 27 February 1977) is a British mathematician, specialising in combinatorics and number theory. He is the Waynflete Professor of Pure Mathematics at the University of Oxford.

Contents

Early life and education

Ben Green was born on 27 February 1977 in Bristol, England. He studied at local schools in Bristol, Bishop Road Primary School and Fairfield Grammar School, competing in the International Mathematical Olympiad in 1994 and 1995. [1] He entered Trinity College, Cambridge in 1995 and completed his BA in mathematics in 1998, winning the Senior Wrangler title. He stayed on for Part III and earned his doctorate under the supervision of Timothy Gowers, with a thesis entitled Topics in arithmetic combinatorics (2003). During his PhD he spent a year as a visiting student at Princeton University. He was a research Fellow at Trinity College, Cambridge between 2001 and 2005, before becoming a Professor of Mathematics at the University of Bristol from January 2005 to September 2006 and then the first Herchel Smith Professor of Pure Mathematics at the University of Cambridge from September 2006 to August 2013. He became the Waynflete Professor of Pure Mathematics at the University of Oxford on 1 August 2013. He was also a Research Fellow of the Clay Mathematics Institute and held various positions at institutes such as Princeton University, University of British Columbia, and Massachusetts Institute of Technology.

Mathematics

The majority of Green's research is in the fields of analytic number theory and additive combinatorics, but he also has results in harmonic analysis and in group theory. His best known theorem, proved jointly with his frequent collaborator Terence Tao, states that there exist arbitrarily long arithmetic progressions in the prime numbers: this is now known as the Green–Tao theorem. [2]

Amongst Green's early results in additive combinatorics are an improvement of a result of Jean Bourgain of the size of arithmetic progressions in sumsets, [3] as well as a proof of the Cameron–Erdős conjecture on sum-free sets of natural numbers. [4] He also proved an arithmetic regularity lemma [5] for functions defined on the first natural numbers, somewhat analogous to the Szemerédi regularity lemma for graphs.

From 2004–2010, in joint work with Terence Tao and Tamar Ziegler, he developed so-called higher order Fourier analysis. This theory relates Gowers norms with objects known as nilsequences. The theory derives its name from these nilsequences, which play an analogous role to the role that characters play in classical Fourier analysis. Green and Tao used higher order Fourier analysis to present a new method for counting the number of solutions to simultaneous equations in certain sets of integers, including in the primes. [6] This generalises the classical approach using Hardy–Littlewood circle method. Many aspects of this theory, including the quantitative aspects of the inverse theorem for the Gowers norms, [7] are still the subject of ongoing research.

Green has also collaborated with Emmanuel Breuillard on topics in group theory. In particular, jointly with Terence Tao, they proved a structure theorem [8] for approximate groups, generalising the Freiman-Ruzsa theorem on sets of integers with small doubling. Green also has worked, jointly with Kevin Ford and Sean Eberhard, on the theory of the symmetric group, in particular on what proportion of its elements fix a set of size . [9]

Green and Tao also have a paper [10] on algebraic combinatorial geometry, resolving the Dirac-Motzkin conjecture (see Sylvester–Gallai theorem). In particular they prove that, given any collection of points in the plane that are not all collinear, if is large enough then there must exist at least lines in the plane containing exactly two of the points.

Kevin Ford, Ben Green, Sergei Konyagin, James Maynard and Terence Tao, initially in two separate research groups and then in combination, improved the lower bound for the size of the longest gap between two consecutive primes of size at most . [11] The form of the previously best-known bound, essentially due to Rankin, had not been improved for 76 years.

More recently Green has considered questions in arithmetic Ramsey theory. Together with Tom Sanders he proved that, if a sufficiently large finite field of prime order is coloured with a fixed number of colours, then the field has elements such that all have the same colour. [12]

Green has also been involved with the new developments of Croot-Lev-Pach-Ellenberg-Gijswijt on applying the polynomial method to bound the size of subsets of a finite vector space without solutions to linear equations. He adapted these methods to prove, in function fields, a strong version of Sárközy's theorem. [13]

Awards and honours

Green has been a Fellow of the Royal Society since 2010, [14] and a Fellow of the American Mathematical Society since 2012. [15] Green was chosen by the German Mathematical Society to deliver a Gauss Lectureship in 2013. He has received several awards:

Related Research Articles

<span class="mw-page-title-main">Analytic number theory</span> Exploring properties of the integers with complex analysis

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

<span class="mw-page-title-main">Timothy Gowers</span> British mathematician

Sir William Timothy Gowers, is a British mathematician. He is Professeur titulaire of the Combinatorics chair at the Collège de France, and director of research at the University of Cambridge and Fellow of Trinity College, Cambridge. In 1998, he received the Fields Medal for research connecting the fields of functional analysis and combinatorics.

In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural density contains a k-term arithmetic progression for every k. Endre Szemerédi proved the conjecture in 1975.

<span class="mw-page-title-main">Jean Bourgain</span> Belgian mathematician (1954–2018)

Jean Louis, baron Bourgain was a Belgian mathematician. He was awarded the Fields Medal in 1994 in recognition of his work on several core topics of mathematical analysis such as the geometry of Banach spaces, harmonic analysis, ergodic theory and nonlinear partial differential equations from mathematical physics.

<span class="mw-page-title-main">Terence Tao</span> Australian-American mathematician (born 1975)

Terence Chi-Shen Tao is an Australian and American mathematician who is a professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins Chair in the College of Letters and Sciences. His research includes topics in harmonic analysis, partial differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing and analytic number theory.

In number theory, the Elliott–Halberstam conjecture is a conjecture about the distribution of prime numbers in arithmetic progressions. It has many applications in sieve theory. It is named for Peter D. T. A. Elliott and Heini Halberstam, who stated the conjecture in 1968.

In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose sumset is small. It roughly states that if is small, then can be contained in a small generalized arithmetic progression.

Erdős' conjecture on arithmetic progressions, often referred to as the Erdős–Turán conjecture, is a conjecture in arithmetic combinatorics. It states that if the sum of the reciprocals of the members of a set A of positive integers diverges, then A contains arbitrarily long arithmetic progressions.

In number theory, the Green–Tao theorem, proved by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for every natural number k, there exist arithmetic progressions of primes with k terms. The proof is an extension of Szemerédi's theorem. The problem can be traced back to investigations of Lagrange and Waring from around 1770.

In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.

<span class="mw-page-title-main">Corners theorem</span>

In arithmetic combinatorics, the corners theorem states that for every , for large enough , any set of at least points in the grid contains a corner, i.e., a triple of points of the form with . It was first proved by Miklós Ajtai and Endre Szemerédi in 1974 using Szemerédi's theorem. In 2003, József Solymosi gave a short proof using the triangle removal lemma.

In arithmetic combinatorics, the Erdős–Szemerédi theorem states that for every finite set of integers, at least one of , the set of pairwise sums or , the set of pairwise products form a significantly larger set. More precisely, the Erdős–Szemerédi theorem states that there exist positive constants c and such that for any non-empty set

Tom Sanders is an English mathematician, working on problems in additive combinatorics at the interface of harmonic analysis and analytic number theory.

In mathematics, in the field of additive combinatorics, a Gowers norm or uniformity norm is a class of norms on functions on a finite group or group-like object which quantify the amount of structure present, or conversely, the amount of randomness. They are used in the study of arithmetic progressions in the group. They are named after Timothy Gowers, who introduced it in his work on Szemerédi's theorem.

<span class="mw-page-title-main">Tamar Ziegler</span> Israeli mathematician

Tamar Debora Ziegler is an Israeli mathematician known for her work in ergodic theory, combinatorics and number theory. She holds the Henry and Manya Noskwith Chair of Mathematics at the Einstein Institute of Mathematics at the Hebrew University.

<span class="mw-page-title-main">Salem–Spencer set</span> Progression-free set of numbers

In mathematics, and in particular in arithmetic combinatorics, a Salem-Spencer set is a set of numbers no three of which form an arithmetic progression. Salem–Spencer sets are also called 3-AP-free sequences or progression-free sets. They have also been called non-averaging sets, but this term has also been used to denote a set of integers none of which can be obtained as the average of any subset of the other numbers. Salem-Spencer sets are named after Raphaël Salem and Donald C. Spencer, who showed in 1942 that Salem–Spencer sets can have nearly-linear size. However a later theorem of Klaus Roth shows that the size is always less than linear.

Roth's theorem on arithmetic progressions is a result in additive combinatorics concerning the existence of arithmetic progressions in subsets of the natural numbers. It was first proven by Klaus Roth in 1953. Roth's theorem is a special case of Szemerédi's theorem for the case .

In mathematics, a nilsequence is a type of numerical sequence playing a role in ergodic theory and additive combinatorics. The concept is related to nilpotent Lie groups and almost periodicity. The name arises from the part played in the theory by compact nilmanifolds of the type where is a nilpotent Lie group and a lattice in it.

References

  1. Ben Green's results at International Mathematical Olympiad
  2. Green, Ben; Tao, Terence (2008). "The Primes Contain Arbitrarily Long Arithmetic Progressions". Annals of Mathematics. 167 (2): 481–547. arXiv: math/0404188 . doi:10.4007/annals.2008.167.481. JSTOR   40345354. S2CID   1883951.
  3. Green, B. (1 August 2002). "Arithmetic progressions in sumsets". Geometric & Functional Analysis. 12 (3): 584–597. doi:10.1007/s00039-002-8258-4. ISSN   1016-443X. S2CID   120755105.
  4. GREEN, BEN (19 October 2004). "The Cameron–Erdos Conjecture". Bulletin of the London Mathematical Society. 36 (6): 769–778. arXiv: math/0304058 . doi:10.1112/s0024609304003650. ISSN   0024-6093. S2CID   119615076.
  5. Green, B. (1 April 2005). "A Szemerédi-type regularity lemma in abelian groups, with applications". Geometric & Functional Analysis. 15 (2): 340–376. arXiv: math/0310476 . doi:10.1007/s00039-005-0509-8. ISSN   1016-443X. S2CID   17451915.
  6. Green, Benjamin; Tao, Terence (2010). "Linear equations in primes". Annals of Mathematics. 171 (3): 1753–1850. arXiv: math/0606088 . doi: 10.4007/annals.2010.171.1753 . JSTOR   20752252.
  7. Green, Ben; Tao, Terence; Ziegler, Tamar (2012). "An inverse theorem for the Gowers U s+1 [N]-norm". Annals of Mathematics. 176 (2): 1231–1372. arXiv: 1006.0205 . doi: 10.4007/annals.2012.176.2.11 . JSTOR   23350588.
  8. Breuillard, Emmanuel; Green, Ben; Tao, Terence (1 November 2012). "The structure of approximate groups". Publications Mathématiques de l'IHÉS. 116 (1): 115–221. arXiv: 1110.5008 . doi:10.1007/s10240-012-0043-9. ISSN   0073-8301. S2CID   119603959.
  9. Eberhard, Sean; Ford, Kevin; Green, Ben (23 December 2015). "Permutations Fixing a k-set". International Mathematics Research Notices. 2016 (21): 6713–6731. arXiv: 1507.04465 . Bibcode:2015arXiv150704465E. doi:10.1093/imrn/rnv371. ISSN   1073-7928. S2CID   15188628.
  10. Green, Ben; Tao, Terence (1 September 2013). "On Sets Defining Few Ordinary Lines". Discrete & Computational Geometry. 50 (2): 409–468. arXiv: 1208.4714 . doi:10.1007/s00454-013-9518-9. ISSN   0179-5376. S2CID   15813230.
  11. Ford, Kevin; Green, Ben; Konyagin, Sergei; Maynard, James; Tao, Terence (16 December 2014). "Long gaps between primes". arXiv: 1412.5029 [math.NT].
  12. Green, Ben; Sanders, Tom (1 March 2016). "Monochromatic sums and products". Discrete Analysis. 5202016 (1). arXiv: 1510.08733 . doi:10.19086/da.613. ISSN   2397-3129. S2CID   119140038.
  13. Green, Ben (23 November 2016). "Sárközy's Theorem in Function Fields". The Quarterly Journal of Mathematics. 68 (1): 237–242. arXiv: 1605.07263 . doi:10.1093/qmath/haw044. ISSN   0033-5606. S2CID   119150134.
  14. "- Royal Society".
  15. List of Fellows of the American Mathematical Society. Retrieved 19 January 2013.
  16. "List of LMS prize winners – London Mathematical Society".