Imre Bennett Leader (born 30 October 1963) is a British mathematician, a professor in DPMMS at the University of Cambridge working in the field of combinatorics. He is also known as an Othello player.
Imre Leader | |
|---|---|
 | |
| Born | 30 October 1963 |
| Alma mater | Cambridge University |
| Awards | Whitehead Prize (1999) |
| Scientific career | |
| Fields | Combinatorics |
| Thesis | Discrete Isoperimetric Inequalities and Other Combinatorial Results (1989) |
| Doctoral advisor | Béla Bollobás |
Life
editHe is the son of the physicist Elliot Leader and his first wife Ninon Neményi (his mother was previously married to the poet Endre Kövesi); Darian Leader is his brother.[1] Imre Lakatos was a family friend and his godfather.[2]
Leader was educated at St Paul's School in London, from 1976 to 1980.[3] He won a silver medal on the British team at the 1981 International Mathematical Olympiad (IMO) for pre-undergraduates.[4] He later acted as the official leader of the British IMO team, taking over from Adam McBride in 1999, to 2001.[5][6][7] He was the IMO's Chief Coordinator and Problems Group Chairman in 2002.[8]
Leader went on to Trinity College, Cambridge, where he graduated B.A. in 1984, M.A. in 1989, and Ph.D. in 1989.[9] His Ph.D. was in mathematics was for work on combinatorics, supervised by Béla Bollobás.[10] From 1989 to 1996 he was Fellow at Peterhouse, Cambridge, then was Reader at University College London from 1996 to 2000. He was a lecturer at Cambridge from 2000 to 2002, and Reader there from 2002 to 2005.[7] In 2000 he became a Fellow of Trinity College.[11]
Awards and honours
editIn 1999 Leader was awarded a Junior Whitehead Prize for his contributions to combinatorics. Cited results included the proof, with Reinhard Diestel, of the bounded graph conjecture of Rudolf Halin.[12][13]
Othello
editLeader in an interview in 2016 stated that he began to play Othello in 1981, with his friend Jeremy Rickard.[14] In the years from 1982 and 2022 he was 16 times the British Othello champion.[15] In 1983 he came second in the world individual championship, and in 1988 he played on the British team that won the world team championship.[16]
As of 2024, Leader has won the European Grand Prix Championship six times, most recently in 2023.[17]
References
edit- ^ Gomori, George (26 January 2022). "Ninon Leader obituary". The Guardian.
- ^ Yap Von Bing (December 2013). "A Conversation with SMS Distinguished Visitor: Imre Leader" (PDF). Mathematical Medley. 39 (2): 8.
- ^ "Mathematics at St Paul's".
- ^ Imre Leader's results at International Mathematical Olympiad
- ^ Bradley, Christopher J. (17 February 2005). Challenges in Geometry: For Mathematical Olympians Past and Present. OUP Oxford. p. vi. ISBN 978-0-19-856691-5.
- ^ McBride, Adam (2002). "IMOs I Have Known". The Mathematical Gazette. 86 (506): 197. doi:10.1017/S002555720017038X. ISSN 0025-5572. JSTOR 3621837. S2CID 173999479.
- ^ a b "Professor Imre Leader – Singapore Mathematical Society". sms.math.nus.edu.sg.
- ^ Yap Von Bing (December 2013). "A Conversation with SMS Distinguished Visitor: Imre Leader" (PDF). Mathematical Medley. 39 (2): 2.
- ^ Cambridge, University of (1991). Cambridge University List of Members. Cambridge University Press. p. 102. ISBN 978-0-521-42597-1.
- ^ Imre Leader at the Mathematics Genealogy Project
- ^ "Master and Fellows". Trinity College, Cambridge.
- ^ "Mathematics People" (PDF). Notices of the AMS: 1239. November 1999.
- ^ Diestel, Reinhard; Leader, Imre (1 December 1992). "A proof of the bounded graph conjecture". Inventiones Mathematicae. 108 (1): 131–162. doi:10.1007/BF02100602. ISSN 1432-1297. S2CID 17240205.
- ^ "WOC 2016 interviews". Othello News.
- ^ "Leader wins Nationals for 16th time". British Othello. 24 July 2022.
- ^ "World Othello Championships". World Othello Federation. Archived from the original on 5 October 2011.
- ^ "European Grand Prix :: World Othello Federation". www.worldothello.org.
External links
edit- Some publications from DBLP [1]
 | This article about a United Kingdom mathematician is a stub. You can help Wikipedia by expanding it. |