Recognitions

Grants and awards:

• Alfred P. Sloan Research Fellowship, 2020-2021.
• NSF CAREER Grant DMS-1945200, Algebraic Methods in Extremal Combinatorics, 2020-2021.
• Frontier of Science Award, 1st International Conference for Basic Science, 2023.
• ICCM Best Paper Award (Gold Medal), 2020.
• Collaboration Grant for Mathematician, Simons Foundation, 2016-2021.
• NSF Grant DMS-1606418, Atlanta Lecture Series in Combinatorics and Graph Theory, 2016-2018.
• AMS-Simons Travel Grant, 2012-2014.
• SIAM DM14 Early Career Travel Award, 2014.
• UCLA Dissertation Year Fellowship, 2011-2012.

Media coverage:

• “Top 50 science stories of 2019”, Discover Magazine.
• “Top 10 biggest math breakthroughs in 2019”, Popular Mechanics.
• “Decades-old computer science conjecture solved in two pages”, Quanta Magazine.
• “This mathematician’s ‘mysterious’ new method just solved a 30-year-old problem”, Live Science.
• “La conjecture de sensibilité enfin résolue”, La Recherche.
• “Resuelto un famoso problema matemático en dos páginas condensadas en un tuit”, El País.
• “수학자들의 SNS 떠들썩하게 한 단 2쪽짜리 증명”, Donga Science.
• “幾十年懸而未解計算機科學猜想的證明竟只需兩頁”, 數理人文第17期.
• Various academic blogs have also reported on my 2019 proof of the Sensitivity Conjecture, including Combinatorics and More, Computational Complexity, Gödel’s Lost Letter and P=NP, Shtetl-Optimized, What’s new, Windows on Theory. The proof has also been simplified and nicely TeXed in one page!