Top Qs
Timeline
Chat
Perspective
Lisa Sauermann
German mathematician From Wikipedia, the free encyclopedia
Remove ads
Lisa Sauermann (born 25 September 1992) is a mathematician from Germany known for her performance in the International Mathematical Olympiad, where in 2011 she had the single highest (and perfect) score. She won four gold medals (2008–2011) and one silver medal (2007) at the olympiad, representing Germany.[2][3]
Sauermann attended Martin-Andersen-Nexö-Gymnasium Dresden when she was in 12th grade. She won the Franz Ludwig Gehe Prize in 2011 and the gold medal in the age group III, the 11th–12th grade competition. As a result, she won a trip to the Royal Academy of Sciences in Stockholm. To achieve this, she presented a new mathematical theorem with a proof in a work entitled "Forests with Hypergraphs".[4]
In 2011 she began studying mathematics at the University of Bonn.[5] In 2014, she completed her bachelor thesis on algebraic geometry under Michael Rapoport.[6] She became a graduate student studying with Jacob Fox at Stanford University where she obtained her PhD in 2019, receiving two prizes for her dissertation titled "Modern Methods in Extremal Combinatorics".[7][8] After her graduation she worked as an assistant professor at Stanford before spending a year at the Institute for Advanced Study in Princeton. In 2021 became an assistant professor at MIT and received the European Prize in Combinatorics at Eurocomb for her work in combinatorics.[9] In 2023 she accepted a tenured professorship at University of Bonn, where she currently works,[10] her main field of work as of 2023[update] being probabilistic combinatorics.[11] In 2022, she was awarded a Sloan fellowship,[12] and in 2023, she received the von Kaven Award.[13]
Her sister, Anne, two years her junior, was a successful participant in math and science Olympiads at the national level.[14]
Remove ads
Selected publications
- ——— (2016). "On the μ-admissible set in the extended affine Weyl groups of E6 and E7". Journal of Algebra. 451: 526–543. arXiv:1411.5427. doi:10.1016/j.jalgebra.2015.11.047. S2CID 118307812.
- Reiher, C.; ——— (2014). "Nash-Williams' theorem on decomposing graphs into forests". Mathematika. 60 (1): 32–36. arXiv:1705.01648. doi:10.1112/S0025579313000119. S2CID 119645044.
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads