Kevin Buzzard

Kevin Mark Buzzard (born 21 September 1968) is a British mathematician and currently a Professor of Pure Mathematics at Imperial College London. He specialises in algebraic number theory.

Kevin Buzzard
Born (1968-09-21) 21 September 1968
Alma materTrinity College, Cambridge
AwardsWhitehead Prize (2002)
Senior Berwick Prize (2008)
L.M.S.
Scientific career
FieldsMathematics
InstitutionsImperial College London
Harvard University
ThesisThe Levels of Modular Representations (1995)
Doctoral advisorRichard Taylor
Doctoral studentsDaniel Snaith
Toby Gee

Biography

While attending the Royal Grammar School, High Wycombe he competed in the International Mathematical Olympiad, where he won a bronze medal in 1986 and a gold medal with a perfect score in 1987.

He obtained a B.A. degree (Parts I & II) in Mathematics at Trinity College, Cambridge, where he was Senior Wrangler (achiever of the highest mark), and went on to complete the C.A.S.M. He then completed his dissertation, entitled The levels of modular representations, under the supervision of Richard Taylor,[1] for which he was awarded a Ph.D. degree.

He took a lectureship at Imperial College London in 1998, a readership in 2002, and was appointed to a professorship in 2004. From October to December 2002 he held a visiting professorship at Harvard University, having previously worked at the Institute for Advanced Study, Princeton (1995), the University of California Berkeley (1996-7), and the Institute Henri Poincaré in Paris (2000).[2]

He was awarded a Whitehead Prize by the London Mathematical Society in 2002 for "his distinguished work in number theory",[3] and the Senior Berwick Prize in 2008.[4]

In 2017, he launched an ongoing "virtual student" project which promoted the use of computer proof verification systems in future pure mathematics research.[5][6]

gollark: I think it's safe as long as it always accesses exactly the same data regardless of input values.
gollark: Simply put ALL data into local variables all the time.
gollark: Yes it can. Just don't index big arrays or use heap memory or whatever.
gollark: And hoping a "smart" compiler or even CPU won't try and be helpful and optimise it somehow.
gollark: And not using stuff like multiplication which may not be constant time.

References
  1. Kevin Buzzard at the Mathematics Genealogy Project
  2. Curriculum vitae, Kevin Buzzard. 2012. [pdf]
  3. "Citation for Kevin Mark Buzzard". Archived from the original on 2009-10-03. Retrieved 2007-02-02.
  4. "LMS Prizewinners". Archived from the original on August 4, 2007.
  5. "Xena". Xena.
  6. "Lean Library currently studying for a degree at Imperial College : kbuzzard/xena". March 23, 2019 – via GitHub.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.