معرفی
Margaret A. Readdy is a Professor of Mathematics at the University of Kentucky, where she has been a faculty member since Fall 2000. She is a member of the Discrete Mathematics group within the Department of Mathematics. Her academic journey includes a PhD in Mathematics followed by a two-year postdoctoral fellowship at Laboratoire de Combinatoire et d'Informatique Mathématiques (LACIM) at Université du Québec à Montréal (UQAM), and a three-year Visiting Assistant Professorship at Cornell University. She has held numerous prestigious visiting positions including at the Institute for Advanced Study in Princeton (1998-1999 and 2010-2011), Stockholm University, MIT (2006-2007), and Princeton University (2014-2015).
Professor Readdy's research focuses on algebraic combinatorics, particularly the interactions of combinatorics with algebra, topology, discrete geometry, and number theory. Her work explores the deep connections between combinatorial structures and other mathematical fields, with significant contributions to the study of polytopes, root systems, Coxeter groups, and flag enumeration. She has developed important insights into the cd-index, Eulerian posets, and combinatorial identities arising from representation theory. Her research is supported by NSF grant DMS-2247382, continuing her long-standing record of externally funded research.
Analysis of Professor Readdy's recent publications (2016-2024) reveals a consistent focus on combinatorial structures with geometric interpretations. Her work often centers on polytopes (particularly the Legendre polytope), triangulations, and the combinatorial properties of Coxeter arrangements. She frequently collaborates with Richard Ehrenborg and other mathematicians, producing results that bridge discrete geometry, algebraic combinatorics, and topology. A notable theme in her recent work is the application of combinatorial methods to solve geometric problems, such as the n-dimensional pizza theorem, and the exploration of connections between different combinatorial structures through bijections and enumerative techniques.
- Involved with Women and Mathematics program that won the AMS 2019 Award for Mathematics Programs that Make a Difference
- Guest editor for March 2018 Notices of the AMS special issue for Women's History Month
- Featured on the cover of the March 2018 Notices of the AMS
Professor Readdy actively mentors students, currently advising PhD students Will Gustafson and Ben Reese. She has received consistent research support from the National Science Foundation, including current grant DMS-2247382. She co-organizes the KOI Combinatorics Lectures (funded by NSF DMS 2435236), which brings together researchers from Kentucky, Ohio, and Indiana. She has organized the Discrete CATS Seminar since 2000 (with some interruptions), fostering a vibrant research community in combinatorics at the University of Kentucky.
Professor Readdy is deeply involved in academic service and outreach. She has been a key participant in the Women and Mathematics (WAM) Program at the Institute for Advanced Study and Princeton University since 2017, serving as Academic Program Manager (2017-2019) and on the WAM Committee (2020-2022). She co-founded the Math Ambassadors program at the University of Kentucky and has organized multiple Julia Robinson Math Festivals. Her commitment to promoting mathematics extends to K-12 education through presentations at local schools and participation in the Kentucky American Water Science Fair.
