Congratulations to Sean Monahan, Sepehr Hajebi, and Alexandra Buhler, all of whom have won Faculty of Mathematics Graduate Research Excellence Awards.
Sean Monahan
Monahan graduated in 2024 with his PhD in Pure Mathematics, and is now working on a postdoc at the Technical University of Munich in Germany. He won a Graduate Research Excellence Award ($5000) for his paper 鈥淗orospherical Stacks and Stacky Coloured Fans.鈥
鈥淚 was absolutely thrilled when I got the news about receiving this award,鈥 Monahan says. 鈥淚t鈥檚 very encouraging to me to see that my research has this level of recognition early on in my career. I am extremely grateful to my PhD supervisor Matt Satriano for all of his guidance and support throughout my time at 蓝莓视频鈥rom start to finish, I really would not have received this award without him.鈥
Monahan explains that his paper works to develop a simplify working with complicated, abstract objects called 鈥渉orospherical stacks.鈥 He compares the process to consulting a German-English dictionary to help him speak and understand German. 鈥淭he idea of my paper is to create a 鈥榗omplicated to simple鈥 dictionary between these 鈥榟orospherical stacks鈥 and some new, fairly simple objects I called 鈥榮tacky coloured fans.鈥 This dictionary makes it much easier to do explicit calculations and build intuition on the complicated objects.鈥
Alexandra Buhler
Alexandra Buhler graduated in 2024 with a PhD in Biostatistics. She co-won a Graduate Research Excellence Award ($2500) for her paper 鈥淢ultistate models as a framework for estimand specification in clinical trials of complex processes.鈥
鈥淚t has been a wonderful surprise to receive recognition for the work I鈥檓 so passionate about!鈥 Buhler says. 鈥淚t makes me feel happy, proud and 鈥 most importantly 鈥 grateful, as this achievement would not have been possible without the guidance of my PhD supervisors Richard J. Cook and Jerry F. Lawless. They showed me continuous support throughout my entire journey and kept pushing me to grow as an independent researcher. I would also like to thank the SAS department for providing a great research environment. I am eager to continue my research and to build upon the expertise that I have acquired at 蓝莓视频.鈥
The paper is the first in a series of four papers resulting from Buhler鈥檚 PhD research into statistical challenges in late-phase clinical drug development. The awarded paper 鈥渃ontributes to the important question of how randomized phase III trials of complex disease processes should be designed and analyzed to make causal, informed statements about the effects of an experimental treatment.鈥
Hajebi with his advisor Sophie Spirkl
Sepehr Hajebi
Sepehr Hajebi graduated in 2024 with his PhD in Combinatorics and Optimization. He is currently doing postdoctoral research at 蓝莓视频, and will soon begin an appointment as junior faculty in the Department of Mathematics at Princeton University in the United States. He co-won a Graduate Research Excellence Award ($2500) for his paper 鈥淚nduced subgraphs and tree decompositions XIII. Basic Obstructions in听鈩-free graphs听for finite听鈩.鈥
鈥淚 am truly honored to receive this award,鈥 Hajebi says. 鈥淭his paper is part of a larger ongoing project that we鈥檝e been working on for nearly four years now. It鈥檚 already been a long way, but there is still much to be done, and having my work recognized is surely motivating to continue pushing forward.鈥 He is particularly grateful to his PhD supervisor Sophie Spirkl as well as his other coauthors on the paper: Bogdan Alecu and Maria Chudnovsky. 鈥淎ll my work on this project is in collaboration with Maria and Sophie, and many of the papers are also joint with varying sets of other collaborators. I am grateful for the countless insightful discussions I鈥檝e had with all of them.鈥
Hajebi鈥檚 paper is the 13th in a series of 18 papers (and counting) exploring the induced subgraph version(s) of the grid theorem. 鈥淚n this paper, specifically, we ask: 鈥楽uppose we choose only a finite number of graphs. Then what should those graphs be so that together they 鈥榬epresent鈥 the local structure of all non-basic induced subgraph obstructions to bounded treewidth?鈥欌 he explains. 鈥淥ur main result answers this question completely.鈥澨 听