Henry Cohn Explained

Henry Cohn
Fields:Mathematics
Doctoral Advisor:Noam Elkies
Thesis Title:New Bounds on Sphere Packings
Thesis Year:2000
Known For:Sphere packing
Alma Mater:MIT
Harvard
Workplaces:Microsoft Research
Website:https://cohn.mit.edu/

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

Cohn graduated from Harvard University in 2000 with a doctorate in mathematics.[9] Cohn was an Erdős Lecturer at Hebrew University of Jerusalem in 2008. In 2016, he became a Fellow of the American Mathematical Society "for contributions to discrete mathematics, including applications to computer science and physics."[10]

In 2018, he was awarded the Levi L. Conant Prize for his article “A Conceptual Breakthrough in Sphere Packing,” published in 2017 in the Notices of the AMS.[11]

External links

Notes and References

  1. Web site: Henry Cohn. 14 July 2017.
  2. Web site: Klarreich. Erica. Erica Klarreich . Sphere Packing Solved in Higher Dimensions. Quanta Magazine. 30 March 2016 . 14 July 2017.
  3. Cohn. Henry. Umans. Christopher. A group-theoretic approach to fast matrix multiplication. IEEE. Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 2003. 438–449. 10.1109/SFCS.2003.1238217. math/0307321.
  4. Cohn. Henry. Kleinberg. Robert. Szegedy. Balász. Umans. Christopher. Group-theoretic Algorithms for Matrix Multiplication. IEEE. Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 2005. 379–388. 10.1109/SFCS.2005.39. math/0511460.
  5. Cohn. Henry. Umans. Christopher. Fast matrix multiplication using coherent configurations. SIAM. Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2013. 1074–1087. 10.1137/1.9781611973105.77. 1207.6528.
  6. Blasiak. Jonah. Church. Thomas. Cohn. Henry. Grochow. Joshua A.. Naslund. Eric. Sawin. William F.. Umans. Christopher. On cap sets and the group-theoretic approach to matrix multiplication. Discrete Analysis. 2017. 10.19086/da.1245. 1605.06702.
  7. Blasiak. Jonah. Church. Thomas. Cohn. Henry. Grochow. Joshua A.. Umans. Christopher. 2017. Which groups are amenable to proving exponent two for matrix multiplication?. 1712.02302 . math.GR.
  8. Blasiak. Jonah. Cohn. Henry. Grochow. Joshua A.. Pratt. Kevin. Umans. Christopher. Matrix Multiplication via Matrix Groups. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). 2023. 19:1–19:16. 10.4230/LIPIcs.ITCS.2023.19. free .
  9. Web site: Henry Cohn MIT Mathematics . 2017-12-22 . 2022-02-19 . https://web.archive.org/web/20220219165822/https://math.mit.edu/directory/profile.php?pid=1224 . dead .
  10. https://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society
  11. Web site: 2018 Levi L. Conant Prize. American Mathematical Society. 7 September 2018.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Henry Cohn".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.