Peter Keevash

Peter Keevash
Born (1978-11-30) 30 November 1978
Brighton, England
Residence Oxford, England
Nationality British
Fields Mathematics
Institutions California Institute of Technology
Queen Mary, University of London
University of Oxford
Alma mater Trinity College, Cambridge
Doctoral advisor Benny Sudakov[1]
Known for Contributions to combinatorial design theory
Notable awards European Prize in Combinatorics (2009)[2]
Whitehead Prize (2015)

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

Early years

Peter 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

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  R(3,k) , namely  R(3,k) \geq (\frac{1}{4} - o(1))k^2/\log k. (This result was obtained independently at the same time by Fiz Pontiveros, Griffiths and Morris.[5])

In 15th 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

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

External links

This article is issued from Wikipedia - version of the Saturday, April 09, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.