Ann Natalie Trenk is an American mathematician interested in graph theory and the theory of partially ordered sets, [1] and known for her research on proper distinguishing colorings of graphs [2] and on tolerance graphs. [3] She is a professor of mathematics at Wellesley College. [1]
Trenk graduated from Harvard University in 1985 and became a high school mathematics teacher. She began graduate study at Johns Hopkins University in 1987, earned a master of science in education in 1989, and completed a Ph.D. in 1991. [4] Her dissertation, Generalized Perfect Graphs, was supervised by Ed Scheinerman. [4] [5]
After postdoctoral research at Dartmouth College and the University of Massachusetts Amherst, she joined the Wellesley faculty in 1992. At Wellesley, she won the Pinanski Teaching Prize in 1995, [6] became a full professor in 2005, and served as department chair from 2014 to 2016. [4]
With Martin Charles Golumbic, Trenk is the author of the book Tolerance Graphs (Cambridge Studies in Advanced Mathematics 89, Cambridge University Press, 2004). [3]
Trenk is the daughter of New York City attorney Joseph Trenk, [7] and is married to fellow Wellesley mathematician Richard Cleary. [8]
James Joseph Sylvester was an English mathematician. He made fundamental contributions to matrix theory, invariant theory, number theory, partition theory, and combinatorics. He played a leadership role in American mathematics in the later half of the 19th century as a professor at the Johns Hopkins University and as founder of the American Journal of Mathematics. At his death, he was a professor at Oxford University.
William Gilbert Strang, usually known as simply Gilbert Strang or Gil Strang, is an American mathematician, with contributions to finite element theory, the calculus of variations, wavelet analysis and linear algebra. He has made many contributions to mathematics education, including publishing seven mathematics textbooks and one monograph. Strang is the MathWorks Professor of Mathematics at the Massachusetts Institute of Technology. He teaches Introduction to Linear Algebra, Computational Science and Engineering, and Matrix Methods and his lectures are freely available through MIT OpenCourseWare.
Cheryl Elisabeth Praeger is an Australian mathematician. Praeger received BSc (1969) and MSc degrees from the University of Queensland (1974), and a doctorate from the University of Oxford in 1973 under direction of Peter M. Neumann. She has published widely and has advised 27 PhD students. She is currently Emeritus Professor of Mathematics at the University of Western Australia. She is best known for her works in group theory, algebraic graph theory and combinatorial designs.
Martin Charles Golumbic is a mathematician and computer scientist known for his research on perfect graphs, graph sandwich problems, compiler optimization, and spatial-temporal reasoning. He is a professor emeritus of computer science at the University of Haifa, and was the founder of the journal Annals of Mathematics and Artificial Intelligence.
David John Aldous, FRS is a mathematician known for his research on probability theory and its applications, in particular in topics such as exchangeability, weak convergence, Markov chain mixing times, the continuum random tree and stochastic coalescence. He entered St. John's College, Cambridge, in 1970 and received his Ph.D. at the University of Cambridge in 1977 under his advisor, D. J. H. Garling. Since 1979 Aldous has been on the faculty at University of California, Berkeley.
David Conlon is an Irish mathematician who is currently a Professor of Mathematics at Caltech. He represented Ireland in the International Mathematical Olympiad in 1998 and 1999. He was an undergraduate in Trinity College Dublin, where he was elected a Scholar in 2001 and graduated in 2003. He earned a Ph.D. from Cambridge University in 2009. In 2019 he moved to Caltech, having been a fellow of Wadham College, Oxford and Professor of Discrete Mathematics in the Mathematics Institute at the University of Oxford. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.
Daniela Kühn is a German mathematician and the Mason Professor in Mathematics at the University of Birmingham in Birmingham, England. She is known for her research in combinatorics, and particularly in extremal combinatorics and graph theory.
Erica Flapan is an American mathematician, the Lingurn H. Burkhead Professor of Mathematics at Pomona College.
Joanna Anthony Ellis-Monaghan is an American mathematician and mathematics educator whose research interests include graph polynomials and topological graph theory. She is a professor of mathematics at the Korteweg-de Vries Institute for Mathematics of the University of Amsterdam.
Emily Riehl is an American mathematician who has contributed to higher category theory and homotopy theory. Much of her work, including her PhD thesis, concerns model structures and more recently the foundations of infinity-categories. She is the author of two textbooks and serves on the editorial boards of three journals.
Alison M. Marr is an American mathematician and mathematics educator. Her research concerns graph theory and graph labeling, and she is also an advocate of inquiry-based learning in mathematics. She works as a professor of mathematics and computer science at Southwestern University in Texas.
Melody Tung Chan is an American mathematician and violinist who works as Associate Professor of Mathematics at Brown University. She is a winner of the Alice T. Schafer Prize and of the AWM–Microsoft Research Prize in Algebra and Number Theory. Her research involves combinatorial commutative algebra, graph theory, and tropical geometry.
Joy Morris is a Canadian mathematician whose research involves group theory, graph theory, and the connections between the two through Cayley graphs. She is also interested in mathematics education, is the author of two open-access undergraduate mathematics textbooks, and oversees a program in which university mathematics education students provide a drop-in mathematics tutoring service for parents of middle school students. She is a professor of mathematics at the University of Lethbridge.
Elizabeth Samantha Meckes (1980–2020) was an American mathematician specializing in probability theory. Her research included work on Stein's method for bounding the distance between probability distributions and on random matrices. She was a professor of mathematics, applied mathematics, and statistics at Case Western Reserve University. She died in December 2020 after a brief battle with cancer.
Leslie Hogben is an American mathematician specializing in graph theory and linear algebra, and known for her mentorship of graduate students in mathematics. She is a professor of mathematics at Iowa State University, where she holds the Dio Lewis Holl Chair in Applied Mathematics; she is also professor of electrical and computer engineering at Iowa State, associate dean for graduate studies and faculty development at Iowa State, and associate director for diversity at the American Institute of Mathematics.
Nancy Ann Neudauer is an American mathematician specializing in matroid theory and known for her work in mathematical outreach in Africa and South America. She is a professor of mathematics at Pacific University, a co-director of the Center for Undergraduate Research in Mathematics, and a former governor of the Pacific Northwest Section of the Mathematical Association of America.
Dona Anschel Papert Strauss is a South African mathematician working in topology and functional analysis. Her doctoral thesis was one of the initial sources of pointless topology. She has also been active in the political left, lost one of her faculty positions over her protests of the Vietnam War, and became a founder of European Women in Mathematics.
In graph theory, a tolerance graph is an undirected graph in which every vertex can be represented by a closed interval and a real number called its tolerance, in such a way that two vertices are adjacent in the graph whenever their intervals overlap in a length that is at least the minimum of their two tolerances. This class of graphs was introduced in 1982 by Martin Charles Golumbic and Clyde Monma, who used them to model scheduling problems in which the tasks to be modeled can share resources for limited amounts of time.
Elizabeth Lee Wilmer is an American mathematician known for her work on Markov chain mixing times. She is a professor, and former department head, of mathematics at Oberlin College.
Karma Dajani is a Lebanese-Dutch mathematician whose research interests include ergodic theory, probability theory, and their applications in number theory. She is an associate professor of mathematics at Utrecht University.