Hao Huang (mathematician)

Hao Huang is a mathematician known for solving the sensitivity conjecture.[1][2] Huang is currently an assistant professor in the mathematics and computer science department at Emory University.

Huang obtained his Ph.D in mathematics from UCLA in 2012 advised by Benny Sudakov.[3] His postdoctoral research was done at the Institute for Advanced Study in Princeton and DIMACS at Rutgers University in 2012-2014, followed by a year at the Institute for Advanced Study at University of Minnesota.[4]

In November 2019 Huang announced a breakthrough, which gave a proof of the sensitivity conjecture.[5] At that point the conjecture had been open for nearly 30 years, having been posed by Noam Nisan and Mario Szegedy in 1992.[6]

Huang received an NSF Career Award in 2019 [7] and a Sloan Research Fellowship in 2020.[8]

References
  1. "Mathematician to present a proof of the Sensitivity Conjecture". phys.org. Retrieved 2019-12-21.
  2. Klarreich, Erica. "Decades-Old Computer Science Conjecture Solved in Two Pages". Quanta Magazine. Retrieved 2019-12-21.
  3. "Hao Huang - The Mathematics Genealogy Project". www.genealogy.math.ndsu.nodak.edu. Retrieved 2019-12-21.
  4. "Welcome to Hao Huang's homepage". www.mathcs.emory.edu. Retrieved 2019-12-21.
  5. Huang, Hao (2019). "Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture". Annals of Mathematics. 190 (3): 949–955. arXiv:1907.00847. Bibcode:2019arXiv190700847H. doi:10.4007/annals.2019.190.3.6. ISSN 0003-486X. JSTOR 10.4007/annals.2019.190.3.6.
  6. Nisan, Noam; Szegedy, Mario (1992). "On the Degree of Boolean Functions As Real Polynomials". Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing. STOC '92. New York, NY, USA: ACM: 462–467. doi:10.1145/129712.129757. ISBN 978-0-89791-511-3.
  7. "NSF Award Search: Award#1945200 - CAREER: Algebraic Methods in Extremal Combinatorics". www.nsf.gov. Retrieved 2020-10-03.
  8. "2020 Fellows". sloan.org. Retrieved 2020-10-03.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.