Peter Kivash ( born Peter Keevash ; born November 30, 1978 , Brighton, UK ) is a British mathematician working on the study of sections of combinatorics . He works as a teacher at Oxford University [1] .
| Peter Kivash | |
|---|---|
| English Peter Keevash | |
| Date of Birth | November 30, 1978 (aged 40) |
| Place of Birth | Brighton |
| A country |  Great Britain |
| Scientific field | mathematics , combinatorics |
| Place of work | California Institute of Technology , Queen Mary University of London, University of Oxford |
| Alma mater | Trinity College (Cambridge) , Princeton University |
| Academic degree | Doctor of Physical and Mathematical Sciences |
| supervisor | Benny Sudakov |
| Known as | made a valuable contribution to the theory of combinatorial schemes |
| Awards and prizes | European Combinatorics Award (2009), Whitehead Award (2015) |
| Site | people.maths.ox.ac.uk/ke... |
Content
Biography
Peter Kivash was born in Brighton, United Kingdom, but he spent all his childhood in Leeds . In 1995, Kivash participated in the International Mathematical Olympiad [2] . Under the leadership of Benny Sudakov, he received a PhD at Princeton University [3] . Prior to his move to Oxford , he worked at Queen Mary University of London from 2013.
Scientific work
Kivash works in the field of combinatorics, in particular for extreme graphs and hypergraphs, as well as for the Ramsey theory . Together with Tom Bonam [4] [5] he set the lower bound for the off-diagonal Ramsey numbers - , namely:
This formula was independently obtained by Fiz Pontiver, Griffiths and Morris [6] [5] ).
On January 15, 2014, Peter published a preprint [7] [5] , which establishes the existence of flow charts with arbitrary parameters, provided that the basic set is high enough and satisfies some obvious conditions of divisibility. In particular, his work gives the first examples of the Steiner system (and, in fact, provides such systems for everyone ) [8] .
Rewards
- European Combinatorics Award (2009) [9] .
- Whitehead Award (2015).
Some publications
- Boman. T : Early evolution of the H-free process . Mathematicae 181 (2010), 291–336.
- Mycroft. R : Geometric theory - hypergraph comparisons, Mem. AMS 233 (2014).
- Existing systems : arxiv.org/abs/1401.3665 .
- Clarreich, E (June 9, 2015): // A Design Dilemma Solved, Minus Desiqnc,.
- WT Giwers : // Probable Combinatorics, and Recent Work by Peter Kivash. AWS 2016 Bulletin .
Notes
- ↑ Prof. Peter Keevash | Mathematical Institute . www.maths.ox.ac.uk. Date of treatment December 18, 2017.
- ↑ International Mathematical Olympiad Neopr . www.imo-official.org. Date of treatment December 18, 2017.
- ↑ Peter Keevash - The Mathematics Genealogy Project . www.genealogy.math.ndsu.nodak.edu. Date of treatment December 18, 2017.
- ↑ Tom Bohman, Peter Keevash. Dynamic concentration of the triangle-free process // arXiv: 1302.5963 [math]. - 2013-02-24.
- ↑ 1 2 3 Mathematics . arxiv.org. Date of treatment December 18, 2017.
- ↑ Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris. The triangle-free process and R (3, k) // arXiv: 1302.6279 [math]. - 2013-02-25.
- ↑ Peter Keevash. The existence of designs // arXiv: 1401.3665 [math]. - 2014-01-15.
- ↑ Amazing: Peter Keevash Constructed General Steiner Systems and Designs (Eng.) , Combinatorics and more (January 16, 2014). Date of treatment December 18, 2017.
- ↑ British Combinatorial Newsletter ,. General News (unavailable link) (October 4, 2009). Archived on November 6, 2013.
Links
- people.maths.ox.ac.uk/keevash/ (English) - the official website of Peter Kivash
- Peter Kivash Online Mathematical Genealogy