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] 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.
[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.
[8] 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".
"[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.