Tom Sanders (mathematician)

Last updated

Tom Sanders
NationalityBritish
Alma mater University of Cambridge
Known for Arithmetic combinatorics
Awards European Prize in Combinatorics (2013)
Whitehead Prize (2013)
EMS Prize (2012)
Adams Prize (2011)
Royal Society University Research Fellowship [1]
Scientific career
FieldsMathematics
Institutions University of Oxford
Thesis Topics in arithmetic combinatorics  (2007)
Doctoral advisor Timothy Gowers [2]
Other academic advisors Ben Green [3]
Website people.maths.ox.ac.uk/sanders

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

Contents

Education

Sanders studied mathematics at the University of Cambridge, where he was awarded a PhD in 2007 for research on arithmetic combinatorics supervised by Timothy Gowers. [2] [3]

Career and research

He held a Junior Research Fellowship at Christ's College, Cambridge from 2006 until 2011, in addition to visiting fellowships at the Institute for Advanced Study in 2007, the MSRI in 2008, and the Mittag-Leffler Institute in 2009. Since 2011, he has held a Royal Society University Research Fellowship (URF) [1] at the University of Oxford, where he is also a senior research fellow at the Mathematical Institute, and a Tutorial Fellow at St Hugh's College, Oxford. [6]

Among other results, he has improved the theorem of Klaus Friedrich Roth on three-term arithmetic progressions, [7] coming close to breaking the so-called logarithmic barrier. More precisely, he has shown that any subset of {1, 2, ..., N} of maximal cardinality containing no non-trivial three-term arithmetic progression is of size [8]

Awards and honours

In February 2011, he was awarded the Adams Prize (jointly with Harald Helfgott) for having "employed deep harmonic analysis to understand arithmetic progressions and answer long-standing conjectures in number theory". [9] In July 2012, he was awarded a Prize of the European Mathematical Society for his "fundamental results in additive combinatorics and harmonic analysis, which combine in a masterful way deep known techniques with the invention of new methods to achieve spectacular results." [10] In July 2013, he was awarded the Whitehead Prize of the London Mathematical Society [11] for his "spectacular results in additive combinatorics and related areas", in particular "for his paper obtaining the best known upper bounds for sets of integers containing no 3-term arithmetic progressions, for his work dramatically improving bounds connected with Freiman's theorem on sets with small doubling, and for other results in additive combinatorics and harmonic analysis." [12] In September 2013, he was awarded the European Prize in Combinatorics. [13]

Related Research Articles

<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">Endre Szemerédi</span> Hungarian-American mathematician

Endre Szemerédi is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.

<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.

<span class="mw-page-title-main">Ben Green (mathematician)</span> British mathematician (born 1977)

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

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 mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.

Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are inverse problems: given the size of the sumset A + B is small, what can we say about the structures of and ? In the case of the integers, the classical Freiman's theorem provides a partial answer to this question in terms of multi-dimensional arithmetic progressions.

<span class="mw-page-title-main">Harald Helfgott</span> Peruvian mathematician

Harald Andrés Helfgott is a Peruvian mathematician working in number theory. Helfgott is a researcher at the CNRS at the Institut Mathématique de Jussieu, Paris. He is best known for submitting a proof, now widely accepted but not yet fully published, of Goldbach's weak conjecture.

<span class="mw-page-title-main">Terry Lyons (mathematician)</span> British mathematician

Terence John LyonsFLSW is a British mathematician, specialising in stochastic analysis. Lyons, previously the Wallis Professor of Mathematics, is a fellow of St Anne's College, Oxford and a Faculty Fellow at The Alan Turing Institute. He was the director of the Oxford-Man Institute from 2011 to 2015 and the president of the London Mathematical Society from 2013 to 2015. His mathematical contributions have been to probability, harmonic analysis, the numerical analysis of stochastic differential equations, and quantitative finance. In particular he developed what is now known as the theory of rough paths. Together with Patrick Kidger he proved a universal approximation theorem for neural networks of arbitrary depth.

Julia Wolf is a British mathematician specialising in arithmetic combinatorics who was the 2016 winner of the Anne Bennett Prize of the London Mathematical Society. She is currently a professor in the Department of Pure Mathematics and Mathematical Statistics at the University of Cambridge.

<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.

The Anne Bennett Prize and Senior Anne Bennett Prize are awards given by the London Mathematical Society.

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 .

Thomas F. Bloom is a mathematician, who is a Royal Society University Research Fellow at the University of Oxford. He works in arithmetic combinatorics and analytic number theory.

<span class="mw-page-title-main">Sarah Peluse</span> American mathematician

Sarah Anne Peluse is an American mathematician specializing in arithmetic combinatorics and analytic number theory, and known for her research on generalizations of Szemerédi's theorem on the existence of polynomial progressions in dense sets of integers. She is an assistant professor and LSA Collegiate Fellow in the Department of Mathematics at the University of Michigan.

<span class="mw-page-title-main">Ruixiang Zhang</span>

Ruixiang Zhang is a mathematician specializing in Euclidean harmonic analysis, analytic number theory, geometry and additive combinatorics. He is an assistant professor in the Department of Mathematics at University of California, Berkeley. He and collaborator Shaoming Guo of the University of Wisconsin proved a multivariable generalization of the central conjecture in Vinogradov's mean-value theorem. Zhang was awarded the 2023 SASTRA Ramanujan Prize for his contributions to mathematics.

<span class="mw-page-title-main">Julian Sahasrabudhe</span> Canadian mathematician

Julian Sahasrabudhe is a Canadian mathematician who is an assistant professor of mathematics at the University of Cambridge, in their Department of Pure Mathematics and Mathematical Statistics. His research interests are in extremal and probabilistic combinatorics, Ramsey theory, random polynomials and matrices, and combinatorial number theory.

References

  1. 1 2 Anon (2017). "Dr Tom Sanders, Research Fellow". royalsociety.org. London: Royal Society. Archived from the original on 1 March 2017. One or more of the preceding sentences incorporates text from the royalsociety.org website where:
    "All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License." -- "Royal Society Terms, conditions and policies". Archived from the original on 11 November 2016. Retrieved 9 March 2016.{{cite web}}: CS1 maint: bot: original URL status unknown (link)
  2. 1 2 Tom Sanders at the Mathematics Genealogy Project
  3. 1 2 Sanders, Tom (2007). Topics in arithmetic combinatorics. cam.ac.uk (PhD thesis). University of Cambridge. OCLC   879379453. Open Access logo PLoS transparent.svg
  4. "Tom Sanders Homepage in Oxford". people.maths.ox.ac.uk.
  5. "Tom Sanders's articles on arXiv". Arxiv.org. Retrieved 9 March 2017.
  6. "Tom Sanders, Mathematical Institute". maths.ox.ac.uk.
  7. Roth, Klaus Friedrich (1953). "On certain sets of integers". Journal of the London Mathematical Society . 28: 104–109. doi:10.1112/jlms/s1-28.1.104. MR   0051853. Zbl   0050.04002.
  8. Sanders, Tom (2011). "On Roth's theorem on progressions". Annals of Mathematics . 174 (1): 619–636. arXiv: 1011.0104 . doi:10.4007/annals.2011.174.1.20. MR   2811612. S2CID   53331882.
  9. "Helfgott and Sanders Awarded Adams Prize" (PDF). Notices of the American Mathematical Society . 58 (7): 966. 2011. (Reprinted from a University of Cambridge announcement.)
  10. "6th European Congress of Mathematics". 6ecm.pl. Retrieved 9 March 2017.
  11. "LMS Prizes 2014". Lms.ac.uk. UK: London Mathematical Society. 9 July 2013. Retrieved 9 March 2017.
  12. "Nick Trefethen, Frances Kirwan, Fernando Alday and Tom Sanders awarded LMS prizes for 2013". UK: University of Oxford Mathematical Institute. 29 September 2014. Retrieved 3 June 2020.
  13. "Tom Sanders wins the European Prize in Combinatorics". UK: University of Oxford Mathematical Institute. 29 September 2014. Retrieved 3 June 2020.