David Conlon

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
David Conlon
David Conlon October 2020.jpg
Born1982 (age 39–40)
NationalityIrish
Alma materUniversity of Cambridge
Trinity College Dublin
AwardsWhitehead Prize (2019)
European Prize in Combinatorics (2011)
Scientific career
FieldsMathematics
InstitutionsUniversity of Oxford
California Institute of Technology
Doctoral advisorTimothy Gowers

David Conlon (born 1982) is an Irish mathematician who is currently a Professor of Mathematics at Caltech. He represented Ireland in the International Mathematical Olympiad in 1998 and 1999.[1] He was an undergraduate in Trinity College Dublin, where he was elected a Scholar in 2001[2] and graduated in 2003. He earned a Ph.D. from Cambridge University in 2009.[3] In 2019 he moved to Caltech, having been a fellow of Wadham College, Oxford and Professor of Discrete Mathematics in the Mathematics Institute at the University of Oxford.[4] His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.[5]

Conlon has worked in Ramsey theory. In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.[6]

He won the European Prize in Combinatorics in 2011, for his work in Ramsey theory and for his progress on Sidorenko's conjecture that, for any bipartite graph H, uniformly random graphons have the fewest subgraphs isomorphic to H when the edge density is fixed.[7] He was awarded the Whitehead Prize in 2019 "in recognition of his many contributions to combinatorics".[8]

References[edit]

  1. ^ "International Mathematical Olympiad Results for Ireland". Retrieved 7 July 2017.
  2. ^ "TCD Scholars Since 1925". Retrieved 7 July 2017.
  3. ^ David Conlon at the Mathematics Genealogy Project
  4. ^ "Curriculum Vitae – David Conlon" (PDF). Retrieved 1 June 2021.
  5. ^ "Prof. David Conlon". Caltech Website. Caltech. Retrieved 1 June 2021.
  6. ^ Conlon, David. "A New Upper Bound for Diagonal Ramsey Numbers" (PDF). www.dpmms.cam.ac.uk. University of Cambridge. Retrieved 25 April 2014.
  7. ^ A kombinatorika kiválóságai az Akadémián (in Hungarian), Hungarian Academy of Sciences, September 1, 2011, archived from the original on November 6, 2013.
  8. ^ "Whitehead Prize 2019 Citation for Professor David Conlon" (PDF). London Mathematical Society. LMS. Retrieved 1 June 2021.

External links[edit]