Extremal combinatorics, probabilistic combinatorics, applications of combinatorics to computer science.
I received my bacherlor's degree in Mathematics at MIT, and a Master of Advanced Study with Distinction at Cambridge University, UK.
My previous internships include conducting research at Microsoft Research New England and Microsoft Research Redmond Theory group.
Strongly testing hereditary permutation properties with polynomial query complexity , Jacob Fox, F. Wei, in preparation .
Fast permutation property testing and metrics of permutations , Jacob Fox, F. Wei, submitted .(arXiv).
Local max-cut in smoothed polynomial time, Omer Angel, Sébastien Bubeck, Yuval Peres, F. Wei, STOC 2017. (arXiv), (A very nice blog written by Sébastien Bubeck about this project.) ( Slides )
Permutation property testing under different metrics with low query complexity , Jacob Fox, F. Wei, SODA, 2017.
On the number of cliques in graphs with a forbidden minor
, Jacob Fox, F. Wei, Journal of Combinatorial Theory, Series B, 2017 (arXiv).
On the number of cliques in graphs with a forbidden subdivision or immersion
, Jacob Fox, F. Wei, submitted . (arXiv).
Graphs with the local sidorenko property, Jacob Fox, F. Wei, in preparation .
Random permutation patterns and online algorithm, Jacob Fox, László Miklós Lovász, F. Wei, in preparation .
Product decompositions of the symmetric group induced by separable permutations, F. Wei, European Journal of Combinatorics, 2012. (arXiv).
Dvoretzky--Kiefer--Wolfowitz inequalities for the two-sample case, F. Wei, Richard Dudley, Statistics & Probability Letters, 2011. (Journal Version, arXiv).
Course Assistant, Math 101 Discovery Lab, Stanford University, Fall 2016.
Course Assistant, Math 107 Graph Theory, Stanford University, Spring 2015.
Teaching Assistant, Calculus Math 1b, Harvard University, Spring 2014.
Email: fanwei [at] stanford [dot] edu
450 Serra Mall
Stanford, CA 94305