Peter Keevash

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Peter Keevash
Born (1978-11-30) 30 November 1978 (age 39)
Brighton, England
Residence Oxford, England
Nationality British
Alma mater Trinity College, Cambridge
Known for Contributions to combinatorial design theory
Awards European Prize in Combinatorics (2009)[1]
Whitehead Prize (2015)
Scientific career
Fields Mathematics
Institutions California Institute of Technology
Queen Mary, University of London
University of Oxford
Doctoral advisor Benny Sudakov[2]

Peter Keevash (born 30 November 1978) is a British mathematician, working in combinatorics. He is Professor of Mathematics at the University of Oxford and a Fellow of Mansfield College.

Early years[edit]

Keevash was born in Brighton, England, but mostly grew up in Leeds. He competed in the International Mathematical Olympiad in 1995.[3] He entered Trinity College, University of Cambridge, in 1995 and completed his B.A. in mathematics in 1998. He earned his doctorate from Princeton University with Benny Sudakov as advisor. He took a postdoctoral position at the California Institute of Technology before moving to Queen Mary, University of London as a lecturer, and subsequently professor, before his move to Oxford in September 2013.

Mathematics[edit]

Keevash has published many results in combinatorics, particularly in extremal graph and hypergraph theory and Ramsey Theory. In joint work with Tom Bohman[4] he established the best-known lower bound for the off-diagonal Ramsey Number , namely (This result was obtained independently at the same time by Fiz Pontiveros, Griffiths and Morris.[5])

On 15 January 2014, he released a preprint [6] establishing the existence of block designs with arbitrary parameters, provided only that the underlying set is sufficiently large and satisfies certain obviously necessary divisibility conditions. In particular, his work provides the first examples of Steiner systems with parameter t ≥ 6 (and in fact provides such systems for all t).

References[edit]

  1. ^ "General News" (PDF), British Combinatorial Newsletter, 7: 3–4, October 2009 
  2. ^ Peter Keevash at the Mathematics Genealogy Project
  3. ^ "Peter Keevash's results". International Mathematical Olympiad. 
  4. ^ Bohman, Tom; Keevash, Peter (2013). "Dynamic concentration of the triangle-free process". arXiv:1302.5963Freely accessible [math.CO]. 
  5. ^ Gonzalo Fiz Pontiveros; Griffiths, Simon; Morris, Robert (2013). "The triangle-free process and R(3,k)". arXiv:1302.6279Freely accessible [math.CO]. 
  6. ^ Keevash, Peter (2014). "The existence of designs". arXiv:1401.3665Freely accessible [math.CO]. 

External links[edit]