Tom Sanders | |
---|---|
Nationality | British |
Fields | Mathematics |
Institutions | University of Oxford |
Alma mater | University of Cambridge |
Thesis | Topics in arithmetic combinatorics (2007) |
Doctoral advisor | Timothy Gowers |
Other academic advisors | Ben Green |
Known for | Arithmetic combinatorics |
Notable awards |
European Prize in Combinatorics (2013) Whitehead Prize (2013) EMS Prize (2012) Adams Prize (2011) Royal Society University Research Fellowship |
Website people |
Tom Sanders is an English mathematician, working on problems in additive combinatorics at the interface of harmonic analysis and analytic number theory.
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.
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) 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.
Among other results, he has improved the theorem of Klaus Friedrich Roth on three-term arithmetic progressions, 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 .