Loading AI tools
British mathematician From Wikipedia, the free encyclopedia
Thomas F. Bloom is a mathematician, who is a Royal Society University Research Fellow at the University of Oxford.[1][2] He works in arithmetic combinatorics and analytic number theory.
Thomas Bloom | |
---|---|
Nationality | British |
Alma mater | University of Oxford University of Bristol |
Awards | Royal Society University Research Fellowship |
Scientific career | |
Institutions | University of Cambridge University of Oxford University of Bristol |
Doctoral advisor | Trevor Wooley |
Other academic advisors | Timothy Gowers |
Thomas did his undergraduate degree in Mathematics and Philosophy at Merton College, Oxford. He then went on to do his PhD in mathematics at the University of Bristol under the supervision of Trevor Wooley. After finishing his PhD, he was a Heilbronn Research Fellow at the University of Bristol. In 2018, he became a postdoctoral research fellow at the University of Cambridge with Timothy Gowers. In 2021, he joined the University of Oxford as a Research Fellow.[3]
In July 2020, Bloom and Sisask[4] proved that any set such that diverges must contain arithmetic progressions of length 3. This is the first non-trivial case of a conjecture of Erdős postulating that any such set must in fact contain arbitrarily long arithmetic progressions.[5][6]
In November 2020, in joint work with James Maynard,[7] he improved the best-known bound for square-difference-free sets, showing that a set with no square difference has size at most for some .
In December 2021, he proved [8] that any set of positive upper density contains a finite such that . This answered a question of Erdős and Graham.[9]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.