Assistant Professor of Applied Mathematics
Extremal Combinatorics, Combinatorial Geometry, Probabilistic Combinatorics
Jacob Fox received a B.S. in mathematics from MIT in 2006. He received the AMS-MAA-SIAM Frank and Brennie Morgan Prize for outstanding research in mathematics by an undergraduate student, and the Jon A. Bucsela Prize for the strongest undergraduate in mathematics at MIT. He finished his Ph.D. in mathematics from Princeton as a Centennial fellow in 2010 under the supervision of Benny Sudakov. He subsequently joined the MIT faculty in applied mathematics as an assistant professor and Simons fellow. Professor Fox's research interests are in combinatorics and graph theory, in particular extremal combinatorics, Ramsey theory, probabilistic methods in combinatorics, combinatorial geometry, and applications of combinatorics to theoretical computer science. He received the SIAM Dénes König Prize in Discrete Mathematics in 2010. In 2012 he received the Edmund F. Kelly Research Award in the Mathematics Department, and in 2013 the Alfred P. Sloan Fellowship.