Hao Huang (mathematician)

Last updated

Hao Huang is a mathematician known for solving the sensitivity conjecture. [1] [2] Huang is currently an associate professor in the mathematics department at National University of Singapore. [3]

Huang received a B.S. degree in mathematics at Peking University in 2007. [3] He obtained his Ph.D. in mathematics from his dissertation titled Various Problems in Extremal Combinatorics from the University of California, Los Angeles (UCLA) in 2012 advised by Benny Sudakov. [4] His postdoctoral research was done at the Institute for Advanced Study in Princeton, New Jersey and DIMACS at Rutgers University in 2012-2014, followed by a year at the Institute for Mathematics and its Applications at the University of Minnesota. Huang then became an assistant professor from 2015 to 2021 in the Department of Mathematics at Emory University. [3]

In July 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 has received positive attention for his discovery, as theoretical computer scientist Scott Aaronson described, "I find it hard to imagine that even God knows how to prove the Sensitivity Conjecture in any simpler way than this." [7]

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

Related Research Articles

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

<span class="mw-page-title-main">László Babai</span> Hungarian mathematician and computer scientist

László "Laci" Babai is a Hungarian professor of computer science and mathematics at the University of Chicago. His research focuses on computational complexity theory, algorithms, combinatorics, and finite groups, with an emphasis on the interactions between these fields.

<span class="mw-page-title-main">Conway knot</span> Prime knot named for John Horton Conway

In mathematics, in particular in knot theory, the Conway knot is a particular knot with 11 crossings, named after John Horton Conway.

In topology, an area of mathematics, the virtually Haken conjecture states that every compact, orientable, irreducible three-dimensional manifold with infinite fundamental group is virtually Haken. That is, it has a finite cover that is a Haken manifold.

<span class="mw-page-title-main">Ernest S. Croot III</span> American mathematician

Ernest S. Croot III is a mathematician and professor at the School of Mathematics, Georgia Institute of Technology. He is known for his solution of the Erdős–Graham conjecture, and for contributing to the solution of the cap set problem.

<span class="mw-page-title-main">Decision tree model</span> Model of computational complexity

In computational complexity theory, the decision tree model is the model of computation in which an algorithm can be considered to be a decision tree, i.e. a sequence of queries or tests that are done adaptively, so the outcome of previous tests can influence the tests performed next.

Lance Jeremy Fortnow is a computer scientist known for major results in computational complexity and interactive proof systems. He is the Dean of the College of Computing at the Illinois Institute of Technology.

Lawrence David Guth is a professor of mathematics at the Massachusetts Institute of Technology.

<span class="mw-page-title-main">Noam Nisan</span> Israeli computer scientist

Noam Nisan is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.

<span class="mw-page-title-main">Yitang Zhang</span> Chinese-born American mathematician

YitangZhang is a Chinese-American mathematician primarily working on number theory and a professor of mathematics at the University of California, Santa Barbara since 2015.

<span class="mw-page-title-main">James A. Maynard</span> British mathematician (born 1987)

James Alexander Maynard is an English mathematician working in analytic number theory and in particular the theory of prime numbers. In 2017, he was appointed Research Professor at Oxford. Maynard is a fellow of St John's College, Oxford. He was awarded the Fields Medal in 2022 and the New Horizons in Mathematics Prize in 2023.

<span class="mw-page-title-main">Yair Minsky</span>

Yair Nathan Minsky is an Israeli-American mathematician whose research concerns three-dimensional topology, differential geometry, group theory and holomorphic dynamics. He is a professor at Yale University. He is known for having proved Thurston's ending lamination conjecture and as a student of curve complex geometry.

<span class="mw-page-title-main">Maryna Viazovska</span> Ukrainian mathematician (born 1984)

Maryna Sergiivna Viazovska is a Ukrainian mathematician known for her work in sphere packing. She is a full professor and Chair of Number Theory at the Institute of Mathematics of the École Polytechnique Fédérale de Lausanne in Switzerland. She was awarded the Fields Medal in 2022.

<span class="mw-page-title-main">Henry Cohn</span> American mathematician

Henry Cohn is an American mathematician. He is a principal researcher at Microsoft Research and an adjunct professor at MIT. In collaboration with Abhinav Kumar, Stephen D. Miller, Danylo Radchenko, and Maryna Viazovska, he solved the sphere packing problem in 24 dimensions. In 2003, with Chris Umans he initiated a group-theoretic approach to matrix multiplication, and is a core contributor to its continued development with various coauthors.

<span class="mw-page-title-main">Kevin Ford (mathematician)</span> American mathematician (born 1967)

Kevin B. Ford is an American mathematician working in analytic number theory.

Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference.

Lisa Marie Piccirillo is an American mathematician who is the Sid W. Richardson Regents Chair in Mathematics at the University of Texas at Austin. She works in the fields of geometry and low-dimensional topology. In 2020, Piccirillo published a mathematical proof in the journal Annals of Mathematics determining that the Conway knot is not a smoothly slice knot, answering an unsolved problem in knot theory first proposed over fifty years prior by English mathematician John Horton Conway.

Dimitris Koukoulopoulos is a Greek mathematician working in analytic number theory as a professor at the University of Montreal.

In computational complexity, the sensitivity theorem, proved by Hao Huang in 2019, states that the sensitivity of a Boolean function is at least the square root of its degree, thus settling a conjecture posed by Nisan and Szegedy in 1992. The proof is notably succinct, given that prior progress had been limited.

References

  1. ↑ "Mathematician to present a proof of the Sensitivity Conjecture". phys.org. Retrieved 2019-12-21.
  2. ↑ Klarreich, Erica (25 July 2019). "Decades-Old Computer Science Conjecture Solved in Two Pages". Quanta Magazine. Retrieved 2019-12-21.
  3. 1 2 3 "Welcome to Hao Huang's homepage" . Retrieved 2021-08-14.
  4. ↑ "Hao Huang - The Mathematics Genealogy Project". www.genealogy.math.ndsu.nodak.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. S2CID   195767594.
  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. pp. 462–467. doi: 10.1145/129712.129757 . ISBN   978-0-89791-511-3. S2CID   6919144.
  7. ↑ Decades-Old Computer Science Conjecture Solved in Two Pages by Erica Klarreich, Quanta Magazine, July 25, 2019
  8. ↑ "NSF Award Search: Award#1945200 - CAREER: Algebraic Methods in Extremal Combinatorics". www.nsf.gov. Retrieved 2020-10-03.
  9. ↑ "2020 Fellows". sloan.org. Archived from the original on 2020-09-25. Retrieved 2020-10-03.

Hao Huang at the Mathematics Genealogy Project

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.