Henry Cohn

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.[3] In 2003, with Chris Umans he initiated a group-theoretic approach to matrix multiplication,[4] and is a core contributor to its continued development with various coauthors.[5][6][7][8][9]

Henry Cohn
Henry Cohn at Oberwolfach, June 2014
Photo by Ivonne Vetter
Alma materMIT[1]
Harvard
Known forSphere packing
Scientific career
FieldsMathematics
InstitutionsMicrosoft Research
Thesis New Bounds on Sphere Packings  (2000)
Doctoral advisorNoam Elkies[2]
Websitehttps://cohn.mit.edu/

Cohn graduated from Harvard University in 2000 with a doctorate in mathematics.[10] 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."[11]

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.[12]

References
  1. "Henry Cohn". Retrieved 14 July 2017.
  2. Henry Cohn at the Mathematics Genealogy Project
  3. Klarreich, Erica (30 March 2016). "Sphere Packing Solved in Higher Dimensions". Quanta Magazine. Retrieved 14 July 2017.
  4. Cohn, Henry; Umans, Christopher (2003). "A group-theoretic approach to fast matrix multiplication". Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 438–449. arXiv:math/0307321. doi:10.1109/SFCS.2003.1238217.
  5. Cohn, Henry; Kleinberg, Robert; Szegedy, Balász; Umans, Christopher (2005). "Group-theoretic Algorithms for Matrix Multiplication". Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 379–388. arXiv:math/0511460. doi:10.1109/SFCS.2005.39.
  6. Cohn, Henry; Umans, Christopher (2013). "Fast matrix multiplication using coherent configurations". Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM. pp. 1074–1087. arXiv:1207.6528. doi:10.1137/1.9781611973105.77.
  7. Blasiak, Jonah; Church, Thomas; Cohn, Henry; Grochow, Joshua A.; Naslund, Eric; Sawin, William F.; Umans, Christopher (2017). "On cap sets and the group-theoretic approach to matrix multiplication". Discrete Analysis. arXiv:1605.06702. doi:10.19086/da.1245.
  8. Blasiak, Jonah; Church, Thomas; Cohn, Henry; Grochow, Joshua A.; Umans, Christopher (2017). "Which groups are amenable to proving exponent two for matrix multiplication?". arXiv:1712.02302 [math.GR].
  9. Blasiak, Jonah; Cohn, Henry; Grochow, Joshua A.; Pratt, Kevin; Umans, Christopher (2023). "Matrix Multiplication via Matrix Groups". 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. pp. 19:1-19:16. doi:10.4230/LIPIcs.ITCS.2023.19.
  10. "Henry Cohn | MIT Mathematics". Archived from the original on 2022-02-19. Retrieved 2017-12-22.
  11. List of Fellows of the American Mathematical Society, retrieved 2017-08-09
  12. "2018 Levi L. Conant Prize" (PDF). American Mathematical Society. Retrieved 7 September 2018.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.