Esmée Fairbairn Junior Research Fellow in Mathematics, New College, Oxford
Mathematical Institute, University of Oxford
In Spring 2017, I am participating in the Pseudorandomness program at the Simons Institute for the Theory of Computing as a Simons–Berkeley Research Fellow.
In Fall 2017, I will be moving to MIT Mathematics as a faculty.
Email:
Research interests
- Extremal and probabilistic combinatorics
- Additive combinatorics
- Graph theory and graph limits
Videos
- Green-Tao theorem and a relative Szemerédi theorem, Simons Institute, Berkeley, Dec 2013
- Sparse graph regularity tutorial, Simons Institute, Berkeley, Jan 2017
- Large deviations for arithmetic progressions, Simons Institute, Berkeley, Apr 2017
Teaching
Polynomial Method in Combinatorics, Trinity Term 2016, Oxford
Short CV
- Ph.D. Mathematics, MIT, 2015 (Advisor: Jacob Fox)
- M.A.St. Mathematics with Distinction, Cambridge, 2011
- S.B. Mathematics, MIT, 2010
- S.B. Computer Science and Engineering, MIT, 2010
Past internships: Microsoft Research New England and Theory Group.