Find Academic Supervisors

Ricky Ini LiuView profile

Associate Professor

• Algebraic Combinatorics
• Algebraic Geometry
• Combinatorial Geometry
• +5 more

Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.

Mark D. HaimanView profile

Professor

• Algebra
• Combinatorics
• Algebraic Geometry
• +12 more

Mark D. Haiman is a Professor at the University of California, Berkeley, Department of Mathematics, with research interests spanning algebra, combinatorics, and algebraic geometry. His work connects symmetric function theory with geometric objects like Hilbert schemes and algebraic structures such as Cherednik algebras and Hecke algebras. Appointed: 2001 Contact: mhaiman@math.berkeley.edu Teaching: Math 256B—Algebraic Geometry (Spring 2025), Math 249—Algebraic Combinatorics (Spring 2024), and others in calculus and Lie groups. Research Interests : Haiman's research focuses on Macdonald polynomials, LLT polynomials, Hilbert schemes of points in the plane, and their combinatorial and geometric implications. His work includes resolving the Macdonald positivity conjecture and the n! conjecture through algebraic geometry. Publications : Haiman has contributed to foundational papers in combinatorial and algebraic structures, including generalizations of the shuffle theorem and positivity results for LLT polynomials. His articles often bridge representation theory, symmetric functions, and geometric methods. Students : He has supervised numerous PhD students, including Magda Hlavacek (2023), Foster Tom (2022), Jeremy Meza (2021), Maryam Farahmand-Asil (2018), Maria Monks Gillespie (2016), and others working on combinatorial algebraic geometry and related fields.

David EppsteinView profile

Professor

• Graph Algorithms
• Computational Geometry
• Graph Theory
• +3 more

David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).

Alan HammondView profile

Professor

• Statistical Mechanics
• Mathematical Probability
• Probability Theory
• +5 more

Alan Hammond is a Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on rigorous mathematical probability techniques applied to problems in statistical mechanics, including percolation theory, polymer models, and random growth processes. He has contributed to understanding critical phenomena, phase transitions, and universality classes in stochastic systems. Hammond's work spans topics such as KPZ universality, Brownian motion, and the geometry of random media. He has investigated models like last passage percolation, self-avoiding walks, and tug-of-war games, often uncovering deep connections between stochastic processes and nonlinear PDEs. His teaching includes courses on stochastic processes and statistical theory at both graduate and undergraduate levels. Notable research highlights include studies on fractal properties of Airy processes, stability in dynamical last passage percolation, and the behavior of geodesics in random environments. His contributions bridge probability theory with applications in physics and combinatorics.

Nathan ReadingView profile

Professor

• Algebraic Combinatorics
• Geometric Combinatorics
• Coxeter Groups
• +3 more

Nathan Reading is a Professor in the Department of Mathematics at North Carolina State University (NCSU). He holds a Ph.D. in Mathematics from the University of Minnesota (2002) and a B.S. in Physics from Stanford University (1995). His research focuses on algebraic and geometric combinatorics, particularly in Coxeter groups, cluster algebras, and lattice-theoretic approaches. He has been actively involved in organizing the Triangle Lectures in Combinatorics, a biannual research conference. His research interests include noncrossing partitions, cluster scattering diagrams, and the lattice theory of torsion classes. Recent work explores connections between Coxeter groups and combinatorial structures on surfaces. Reading has authored numerous papers on topics such as semidistributive lattices, scattering diagrams, and Cambrian frameworks. He teaches advanced combinatorics courses (e.g., MA 724: Combinatorics II) and has advised graduate students. His work has been supported by grants from the National Science Foundation (NSF), including DMS-1500949. Reading maintains an active presence in the mathematics community through publications, conference organization, and pedagogical contributions.

Benjamin SteinbergView profile

Professor

• Finite Semigroup Theory
• Geometric Group Theory
• Algebraic Combinatorics
• +5 more

Benjamin Steinberg is a Professor in the Mathematics Department at the City College of New York (CCNY) and the CUNY Graduate Center. He holds a Ph.D. from the University of California, Berkeley (1998) under John Rhodes and has held positions at the University of Porto (Portugal) and Carleton University (Canada). His research focuses on algebra, including semigroups, geometric group theory, algebraic combinatorics, representation theory, and automata theory, with notable work on etale groupoids, inverse semigroups, and ring theory. He is the author of several books, including *The q-theory of Finite Semigroups* and *Representation Theory of Finite Monoids*. Steinberg serves as Managing Editor of the *International Journal of Algebra and Computation* and has organized conferences such as the International Conference on Semigroups and Groups in Honor of John Rhodes. Research interests include the interplay between algebraic structures and their applications, such as in automata theory and Markov chains. His work bridges pure mathematics with combinatorial and geometric approaches, often involving categorical and topological methods. Recent articles explore topics like Nekrashevych algebras, twisted Steinberg algebras, and Lyndon's identity theorem for monoids. He has contributed to the study of profinite groups and their connections to symbolic dynamics. Steinberg’s editorial roles and conference organization reflect his leadership in the mathematical community. Despite his defunct blog, his academic contributions remain prolific, with ongoing editorial work and research in algebraic combinatorics and representation theory.

Ron PeledView profile

Professor

• Probability Theory
• Statistical Physics
• Mathematical Physics
• +7 more

Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.

• Branching processes
• Random trees
• Reinforcement processes
• +9 more

Cécile Mailler is a Reader in Probability at the University of Bath, where she is a member of the probability group Prob-L@B. She has held significant research positions including an EPSRC postdoctoral fellowship (2018-2021) titled "Random trees: analysis and applications" and previously worked as a postdoc at Prob-L@B (2013-2016) as part of Peter Mörters' EPSRC project "Emergence of Condensation in Stochastic Networks". She earned her PhD under the supervision of Brigitte Chauvin and Danièle Gardy at the Laboratoire de Mathématiques de Versailles. Her research focuses on probability theory with emphasis on branching processes, random trees, reinforcement mechanisms, Pólya urns, stochastic approximation, random networks, and statistical physics. She has made significant contributions to understanding preferential attachment models, zero-range processes, and random Boolean trees. Her work bridges theoretical probability with applications in statistical physics and combinatorics. Analysis of her recent publications shows a strong focus on random tree structures, branching processes, and reinforcement learning algorithms, with applications spanning from network theory to statistical mechanics. Her research demonstrates sophisticated mathematical techniques applied to complex stochastic systems, particularly those with reinforcement mechanisms and memory effects. Associate Editor of the Applied Probability Trust (since October 2020) Associate Editor of Stochastic Processes and Their Applications (since March 2022) Author of a general introduction to Pólya urns for the LMS Newsletter (November 2020) Co-organizer of the "Random Walks: Applications and Interactions" conference at CIRM (January 2026) She actively supervises PhD students working on topics including the multi-city ants process, Pólya urns with growing initial composition, large deviations for the Monkey walk, and competing growth processes. She has secured research funding through EPSRC fellowships and has been involved in multiple collaborative projects with prominent researchers in probability theory. Mailler regularly teaches mini-courses on advanced probability topics at international summer schools and workshops, demonstrating her commitment to knowledge dissemination in the field.

• Cryptography
• Information Security
• Applied Mathematics
• +3 more

Carles Padro Laimon is a Professor at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Mathematics and the School of Telecommunications Engineering. He is a leading researcher in cryptography and information security, focusing on secret sharing schemes, combinatorial structures, and cryptographic protocols. His work integrates discrete mathematics, coding theory, and algorithmic design to address security challenges in digital systems. Padro leads the MAK Research Group (Mathematics Applied to Cryptography) and the ISG-MAK Information Security Group. He has been involved in numerous competitive research projects, including initiatives on post-quantum cryptography and secure multi-user systems. His contributions span over 211 documented activities, including articles, theses, and conference participations. His research interests include the theoretical foundations of cryptography, with a focus on optimizing secret sharing schemes, analyzing matroid-based structures, and developing secure communication protocols. He has collaborated extensively with institutions like the UPC and European research networks, contributing to both academic and practical advancements in cybersecurity. Padro holds a PhD in Mathematics from UPC and has supervised doctoral theses and mentored researchers in his field. His work frequently appears in top journals like IEEE Transactions on Information Theory, Designs, Codes and Cryptography, and SIAM Journal on Discrete Mathematics.

• Probability Theory
• Random Discrete Structures
• Random Trees
• +6 more

Igor Kortchemski is a CNRS researcher at the Department of Mathematics and Applications (DMA) at École Normale Supérieure, Paris, and a lecturer in the Department of Applied Mathematics at École Polytechnique. His primary research focuses on the continuous limits of random discrete models, particularly examining how discrete combinatorial structures converge to continuous objects under appropriate scaling. His educational background includes a PhD in Mathematics (2012) under Jean-François Le Gall at École Normale Supérieure and a Habilitation à diriger des recherches (HDR) in Mathematics (2016). Kortchemski's research spans several interconnected areas: Random trees and Galton-Watson processes with heavy-tailed distributions Random planar maps and their geometric properties Growth-fragmentation processes and their connections to Lévy processes Scaling limits of combinatorial structures and their continuous counterparts His publication record shows a consistent focus on the geometric properties of random discrete structures, with recent work (2023-2025) exploring uniform attachment processes with freezing, critical tree phenomena, and the mesoscopic geometry of sparse random maps. His research often involves sophisticated probabilistic analysis combined with combinatorial insights. Scientific recognition includes: prix de thèse solennel Perrissin-Pirasset / Schneider de la chancellerie des Universités de Paris (2012) Kortchemski actively contributes to academic service: Examiner for the minor math exam at École Polytechnique (FUF) since 2023 Member of the mathematics jury for ENS International Selection (2023) Member of the jury for the external mathematics competitive examination (Agrégation) since 2021 Member of the jury for the Arts and Economic and Social Sciences Bank (B/L) mathematics exams (2015-2018) He mentors the next generation of researchers as co-director of Antoine Aurillard's and Vanessa Dan's theses (both since 2023), and previously directed Etienne Bellin's (2020-2023) and Paul Thevenin's (2017-2020) theses.

Michael J. SchlosserView profile

Professor

• Combinatorics
• Number Theory
• Special Functions
• +3 more

Michael J. Schlosser is a faculty member at the Faculty of Mathematics , University of Vienna. His research focuses on combinatorics, number theory, and special functions, with a particular emphasis on hypergeometric and q-series, elliptic extensions, and rook theory. He has authored numerous publications in collaboration with prominent mathematicians such as Victor Guo, Meesue Yoo, and Christian Krattenthaler. Research Interests : Combinatorics and hypergeometric series Elliptic functions and their applications Partition theory and supercongruences Matrix inversions and determinant evaluations Students : Josef Küstner (Ph.D., 2022) Christian Stump (Ph.D., 2008) Editorial Roles : Associate Editor, Journal of Mathematical Analysis and Applications Editorial Board Member, The Ramanujan Journal Editorial Board Member, Journal of Algebraic Combinatorics

• Probability Theory
• Stochastic Processes
• Mathematical Physics
• +3 more

Balint Toth is a distinguished academic with dual affiliations: a Research Professor at the Alfréd Rényi Institute of Mathematics in Budapest and a Professor of Probability (Heilbronn Chair) at the University of Bristol 's School of Mathematics. His work bridges Probability Theory , Mathematical Physics , and Statistical Mechanics , focusing on stochastic dynamics, random walks in complex environments, and scaling limits. Key Roles: Co-Editor-in-Chief of Probability Theory and Related Fields , organizer of probability seminars in Budapest-Vienna and Bristol, and former leader of the BME Stochastics Seminar (1999–2020). Teaching: Delivers advanced courses like Probability 2 , Stochastic Differential Equations , and Percolation , emphasizing rigorous mathematical foundations. Research Themes include hydrodynamic limits, self-interacting random walks, diffusion in random media, and symmetry breaking in spin systems. His recent publications explore non-equilibrium stochastic models, anomalous diffusion, and connections between probability and physics. Teaching Materials span bilingual resources (Hungarian/English) for undergraduate and graduate courses in probability and stochastic analysis.

Tom VerhoeffView profile

Assistant Professor

• Software Engineering
• Model-Driven Engineering
• Domain-Specific Languages
• +7 more

Tom Verhoeff is an Assistant Professor at the Faculty of Mathematics and Computing Science of Eindhoven University of Technology (TU/e) , working within the Software Engineering & Technology group. His research focuses on Model-Driven Engineering (MDE) , Domain-Specific Languages (DSLs) , and the intersection of mathematics, computing, and the arts . He teaches courses in data analytics, programming, algorithms, theoretical computer science , and logic . Verhoeff earned both his MSc and PhD in Technical Science (Mathematics and Computer Science) from TU/e. He is actively involved in promoting mathematics and informatics through initiatives like the annual Bridges conference , and serves as board member and treasurer of the Dutch Mathematics Olympiad , as well as chair of the Koos Verhoeff MathArt foundation . He has also held roles as guest lecturer in Lithuania and Finals Director for the ACM International Collegiate Programming Contest . Research Interests: Verhoeff’s work spans Model-Driven Engineering , domain-specific language development , and 3D geometric modeling . His scholarship often explores symmetry, recursion, and mathematical visualization , particularly through computational art and algorithmic puzzles . Recent publications highlight 3D rotation methods , knot theory , and mathematical art using lattice paths and geometric transformations . Scientific Awards: ACM ICPC European Founders Award (2004) IOI Distinguished Service Award (2007) Second Place in the 2022 Wolfram Computational Art Contest Notable Collaborations and Affiliations: He is affiliated with the Esprit Working Group on Asynchronous Circuit Design (ACiD-WG) , WIRE (TUE Mathematics Alumni) , ACM (Senior Member) , CSTA , IEEE Computer Society , and Royal Dutch Mathematical Society (KWG) .

Tom RobyView profile

Professor

• Algebraic Combinatorics
• Enumerative Combinatorics
• Dynamical Algebraic Combinatorics
• +4 more

Tom Roby is a tenured full Professor in the Department of Mathematics at the University of Connecticut (UConn). He holds a Ph.D. in algebraic combinatorics from MIT under Richard Stanley, with prior degrees from Swarthmore College and Kenwood Academy. His research focuses on algebraic and enumerative combinatorics, particularly birational rowmotion, homomesy, and dynamical algebraic combinatorics. He has held faculty roles at Cal State Hayward (now East Bay), the University of Wisconsin, Reed College, and the University of Tokyo as a JSPS postdoctoral fellow. Roby has directed the Quantitative Learning Center (Q Center) at UConn from 2005–2012 and contributed to educational outreach programs such as ACCLAIM and PROMYS. His teaching includes courses like Math 2210Q (Applied Linear Algebra). He actively engages in academic service, including directing summer programs for students and K–12 teachers. His work bridges theoretical research with practical education, emphasizing combinatorial dynamics and algebraic structures. His professional activities include organizing workshops on dynamical algebraic combinatorics and publishing extensively on topics like rowmotion, toggling, and poset dynamics. He maintains a robust online presence with course materials, software resources, and collaborations through platforms like Zulip and Nexus.

Pavel GalashinView profile

Associate Professor

• Algebraic Combinatorics
• Total Positivity
• Cluster Algebras
• +5 more

Pavel Galashin is an Associate Professor in the Department of Mathematics at the University of California, Los Angeles, where he joined in 2019 after completing his PhD at MIT under Alex Postnikov. His research focuses on algebraic combinatorics with emphasis on total positivity and cluster algebras. His primary research interests include algebraic combinatorics, total positivity, cluster algebras, amplituhedra, plabic graphs, positroids, and connections to mathematical physics. His work bridges combinatorics with algebraic geometry, representation theory, and theoretical physics, particularly in scattering amplitudes and integrable systems. Galashin's recent publications reveal a strong focus on braid varieties, positroid varieties, and their connections to cluster structures. His research shows significant interdisciplinary impact across combinatorics, algebraic geometry, and mathematical physics, with particular attention to geometric structures in scattering amplitudes and connections to knot theory. He has received an Alfred P. Sloan Research Fellowship and NSF funding through grants DMS-1954121 and DMS-2046915 (CAREER). Galashin advises multiple PhD students including Matthew Tyler, Ariana Chin, Thomas Martinez, and Olha Shevchenko, and co-mentors postdocs such as Terrence George and Colleen Robichaux. Together with Anton Bernshteyn, Terrence George, Igor Pak, and Colleen Robichaux, he organizes the UCLA Combinatorics Forum.