Find Academic Supervisors

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.

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

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

• Combinatorics
• Graph Theory
• Applied Probability
• +6 more

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

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

Eric Larson is an Associate Professor at Brown University's Department of Mathematics, specializing in algebraic geometry. His research focuses on moduli spaces, Brill-Noether theory, and algebraic curves. He collaborates with notable mathematicians such as Isabel Vogt and Izzet Coskun on topics like normal bundles, Chow rings, and stability conditions. Larson actively engages in academic outreach, organizing Putnam competition practices and undergraduate colloquia. He has developed computational tools for studying elliptic curves' Galois representations and contributed to expository works on interpolation problems and LaTeX accessibility.

• Algebraic Geometry
• Brill-Noether Theory
• Moduli Spaces
• +3 more

Stanislav Smirnov is a Professor at the University of Geneva's Department of Mathematics since 2003 and Head of the Chebyshev Laboratory at St. Petersburg State University since 2010. He holds a Ph.D. from the California Institute of Technology (1996) and a B.Sc./M.Sc. from St. Petersburg State University (1992). His research focuses on mathematical physics, probability, complex analysis, and dynamical systems, with groundbreaking contributions to the understanding of critical phenomena in statistical physics. Key achievements include receiving the Fields Medal (2010), the highest honor in mathematics, for his work on percolation and the Ising model. He has organized major international conferences, such as the 'St. Petersburg School in Probability & Statistical Physics' (2012) and the '2D Statistical Physics Workshop' (2013). His academic career includes positions at Yale University, the Max-Planck Institute, and KTH Royal Institute of Technology. Education: Ph.D., Mathematics, California Institute of Technology (1996) B.Sc./M.Sc., Mathematics (with honors), St. Petersburg State University (1992) Awards: Fields Medal (2010) European Research Council Advanced Grants (2008, 2013) Rollo Davidson Prize (2002) Salem Prize (2001) Smirnov’s research bridges probability theory and complex analysis, with notable results on conformal invariance in two-dimensional models. His work has advanced understanding of critical exponents, percolation thresholds, and the universality of phase transitions. He advises doctoral students and collaborates internationally on projects funded by Swiss and European grants. He co-organized over 20 conferences worldwide, including plenary talks at the International Congress of Mathematicians (2006, 2010) and the World Congress in Probability and Statistics (2012). His lab fosters interdisciplinary research, linking mathematics to physics and computer science.

• Mathematical Physics
• Probability
• Complex Analysis
• +3 more

Jinhyung Park is an Associate Professor in the Department of Mathematical Sciences at KAIST, Daejeon, Korea. He obtained his Ph.D. from KAIST in 2014 under Prof. Sijong Kwak and was mentored as a CMC Fellow at KIAS (2014–2019). His research focuses on Algebraic Geometry , particularly syzygies of algebraic varieties , secant varieties , and positivity of line bundles . Education: Ph.D., KAIST (2014); MS/BS, KAIST and University of Chicago (2002/2001). Research Interests: His work explores geometric properties of projective manifolds, singularities in algebraic geometry, and applications of Okounkov bodies to divisors and syzygies. Recent trends include Castelnuovo-Mumford regularity bounds (e.g., for threefolds with rational singularities) and subadditivity of Okounkov bodies in fiber spaces. Teaching: Courses include Matrix Groups, Algebraic Geometry, and Calculus. He previously taught at Sogang University and Purdue University. Professional Affiliations: Member of the Korean Mathematical Society, American Mathematical Society, and other international societies. Organized the 8th East Asia Number Theory Conference at KAIST (2019).

• Algebraic Geometry
• Syzygies of Algebraic Varieties
• Secant Varieties
• +6 more

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +4 more

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +12 more

Ewain Gwynne is a Professor of Mathematics at the University of Chicago, affiliated with the Committee on Computational and Applied Mathematics (CCAM) and the Statistics Department. He previously held postdoctoral positions at the University of Cambridge and earned his Ph.D. from MIT in 2018 under Scott Sheffield. His research focuses on probability theory, particularly random geometric structures in statistical mechanics, including Schramm-Loewner evolution (SLE), Liouville quantum gravity (LQG), and random planar maps. Education: Ph.D. in Mathematics, MIT (2018); M.Sc., MIT (2015); B.Sc., Northwestern University (2013). Research Interests: Random geometric objects in statistical mechanics Liouville quantum gravity and its metric properties Random planar maps and their scaling limits SLE and its relationship with LQG Random walks on random planar maps Percolation and permutons His recent articles explore topics such as supercritical LQG, Gaussian curvature on random maps, and harmonic balls in LQG. He has advised multiple Ph.D. students and serves as an associate editor for Probability and Mathematical Physics . His work bridges probability theory, geometry, and mathematical physics, with applications to understanding critical phenomena in random systems.

• Probability Theory
• Liouville Quantum Gravity
• Random Planar Maps
• +7 more

Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.

• Combinatorics
• Probability
• Graph Theory
• +3 more

Annina Iseli is a Lecturer in the Department of Mathematics at École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the College of Basic Sciences. She holds dual roles as both a Scientist and Lecturer, contributing to research and teaching within the Institute of Mathematics (MATH-GE). Her work bridges pure and applied mathematics, focusing on geometric and analytical properties of fractals. University: École Polytechnique Fédérale de Lausanne (EPFL) School: College of Basic Sciences Department: Institute of Mathematics (MATH-GE) Role: Lecturer and Scientist Research interests span multiple areas in mathematics: Fractal geometry and its connections to complex dynamics Geometric measure theory applications to projections in normed spaces Conformal and quasiconformal geometry Analysis in metric spaces Her publications include work on projection theorems, fractal dimensions, and hyperbolic space properties. She co-organizes the Quasiworld Seminar and EPFL Geometry Seminar, collaborating with researchers like Mario Bonk, Nicolas Monod, and Zoltán Balogh. Contact: annina.iseli@epfl.ch

• Fractal Geometry
• Complex Dynamics
• Geometric Measure Theory
• +3 more

Lukas Brantner is a Royal Society University Research Fellow at the Mathematical Institute of the University of Oxford. His research focuses on geometry, topology, and derived algebraic structures, with a particular emphasis on partition Lie algebras, deformation theory, and higher algebraic frameworks. His recent work spans topics such as derived foliations, Poincaré-Birkhoff-Witt theorems, and the complexity of geometric objects like Calabi-Yau varieties in characteristic p. This reflects a deep interplay between algebraic topology, homotopy theory, and modern algebraic geometry. Major Themes: Derived Algebraic Geometry, Homotopy Theory, Deformation Theory, Galois Theory Collaborators: Magidson, Nuiten, Antolín-Camarena, Heuts, Taelman, Campos, Waldron, Hahn, Knudsen, Mathew, Arone, Manners Scientific Awards & Honors: Royal Society University Research Fellow Brantner actively contributes to foundational research in algebraic topology and derived structures, often bridging pure algebra with topological phenomena. His publications highlight the evolution of partition Lie algebras, configuration spaces, and Goodwillie calculus in modern mathematics.

• Geometry
• Topology
• Algebraic Topology
• +4 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.

• Algebra
• Combinatorics
• Algebraic Geometry
• +12 more

Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.

• Mathematical Optimization
• Convex Optimization
• Non-convex Optimization
• +7 more