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.

Eric LarsonView profile

Associate Professor

• Algebraic Geometry
• Brill-Noether Theory
• Moduli Spaces
• +3 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
• Syzygies of Algebraic Varieties
• Secant Varieties
• +6 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).

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 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.

Jacob FoxView profile

Professor

• Combinatorics
• Probability
• Graph Theory
• +3 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.

Lukas BrantnerView profile

Research Fellow

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

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.

Anoosheh HeidarzadehView profile

Assistant Professor

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +3 more

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.

James MaynardView profile

Professor

• Analytic Number Theory
• Prime Numbers
• Sieve Methods
• +1 more

James Maynard is a Professor of Number Theory at the University of Oxford , holding a Title IV Professorship equivalent to a UK chair or US full professor. He has held prestigious positions including Membership at the Institute for Advanced Study (Princeton, 2017), Research Membership at MSRI (Berkeley, 2017), and a Clay Research Fellowship (2015-2018). His research focuses on analytic number theory , particularly prime numbers and sieve methods , with groundbreaking work on prime gaps and Diophantine approximation. EDUCATION DPhil in Mathematics (2009-2013), Balliol College, Oxford Part III Mathematics (2008-2009), Queens’ College, Cambridge BA Mathematics (2005-2008), Queens’ College, Cambridge Maynard’s research explores the structure of prime numbers, including prime distribution , digital properties of primes , and norm form representations . His work has revolutionized understanding of bounded prime gaps and extremal prime spacing using advanced sieve techniques and probabilistic methods. Maynard’s publications (15 most recent) span analytic number theory , prime distribution , and Diophantine approximation . Key subfields include Bounded Gaps Between Primes , Digital Restrictions in Primes , Probabilistic Methods in Number Theory , and Algorithmic Sieve Optimization . Scientific Awards Fields Medal (2022) Cole Prize in Number Theory (2020) ERC Starting Grant (€1.5m, 2020-2025) Compositio Prize (2019) Wolfson Merit Award (2017) EMS Prize (2016) Erdős $10,000 Problem Prize (2016) Clay Research Fellowship (2015-2018) Whitehead Prize (2015) Ramanujan Prize (2014) Maynard has advised no explicitly named students but collaborates extensively in number theory. His grants include the ERC Starting Grant (2020-2025) and Wolfson Merit Award (2018-2023) . He has contributed to collaborative projects like the Polymath group and served as a Summer Consultant at GCHQ/Heilbronn Institute (2008-2012).

Fatma Kılınç-KarzanView profile

Associate Professor

• Mathematical Optimization
• Convex Optimization
• Non-convex Optimization
• +7 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.

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Dinesh S. ThakurView profile

Professor

• Number Theory
• Arithmetic Geometry
• Function Field Arithmetic
• +7 more

Professor Dinesh S. Thakur holds the position of Professor in the Department of Mathematics at the University of Rochester. He earned his PhD from Harvard University and has made significant contributions to number theory, arithmetic geometry, and function field arithmetic. His research focuses on developing theories related to zeta functions, Drinfeld modules, and p-adic analysis in finite characteristic environments. Education: PhD in Mathematics, Harvard University Research Interests: Thakur’s work integrates advanced topics such as elliptic curves, modular forms, Diophantine equations, and the arithmetic of function fields. He has pioneered studies on multizeta values, p-adic continued fractions, and the distribution of Diophantine exponents in finite characteristic. His research bridges classical number theory with modern algebraic geometry and p-adic analysis. Teaching & Mentorship: Thakur has taught a wide range of courses, including graduate-level topics in function field arithmetic, algebraic geometry, and number theory. He has advised 11 PhD students and several master’s students, whose theses span themes like elliptic Carmichael numbers, Drinfeld modular forms, and multizeta relations. Notable advisees include Javier Diaz-Vargas (1996), George Todd (2015), and Yao-Rui Yeo (2021). Outreach & Contributions: Thakur participates in initiatives like the Arizona Winter School and Olympiad training programs in India. He maintains an active seminar series at UR on topics such as L-values, Fermat’s Last Theorem, and automatic sequences. His work is accessible through his personal page and MathSciNet.

Jelena GrbicView profile

Professor

• Topology
• Algebra
• Combinatorics
• +6 more

Professor Jelena Grbic is a distinguished mathematician serving as Professor of Mathematics within the School of Mathematical Sciences at the University of Southampton since 2012. Her academic journey began with a B.Sc. in Mathematics from the University of Belgrade, Serbia in 1997, followed by a Ph.D. in Algebraic Topology from the University of Aberdeen in 2004. Prior to her current position, she held academic appointments at the University of Manchester (2007-2012) as Lecturer and Senior Lecturer, and at the University of Aberdeen (2004-2006) as Lecturer. Professor Grbic's research spans multiple interconnected domains of pure mathematics, with a primary focus on modern homotopy theory, particularly unstable homotopy theory, and its applications across topology, algebra, and geometry. Her work centers on decompositions and exponent problems in homotopy theory, homotopy aspects of Toric Topology, Hopf algebras, and geometric problems related to cobordisms and string topology. This research bridges abstract mathematical theory with potential applications in data science and computational topology. Analysis of her recent publications (2020-2025) reveals a consistent research trajectory in algebraic topology with increasing interdisciplinary connections. Her work demonstrates sophisticated mathematical techniques applied to complex topological structures, particularly moment-angle complexes and polyhedral products. Notably, her 2022 paper 'Aspects of topological approaches for data science' indicates growing interest in applying topological methods to contemporary data analysis problems, suggesting an expanding research horizon beyond pure mathematics. Professor Grbic actively supervises PhD students, including current student Salvatore Elia in Mathematical Sciences, and teaches modules covering algebraic topology and homotopy theory. She serves as a reviewer for prestigious journals including Homology, Homotopy and Application (2019), Transactions of the London Mathematical Society (2021), and The LMS Newsletter (2017), contributing to the scholarly community through peer review and academic service.

• Commutative Algebra
• Algebraic Geometry
• Hyperplane Arrangements
• +4 more

Ştefan Tohăneanu is a Professor in the Department of Mathematics and Statistical Science at the University of Idaho , affiliated with the College of Science. His academic journey includes a Ph.D. in Mathematics from Texas A&M University (2007), and M.S. degrees in Algebra (2001) and Analysis (2001) from the University of Bucharest, where he also earned a B.S. in Mathematics (1997). Research Focus: Commutative Algebra, Hyperplane Arrangements, Matroid Theory, and applications to Coding Theory, including generalized Hamming weights, Orlik-Terao algebras, and homological properties of ideals. Publications: Recent work explores Betti numbers, Jacobian ideals, logarithmic derivations, and connections between algebraic invariants and coding theory problems like minimum distance computation and error correction. Collaborations: Engages with global research networks through affiliations with institutions such as Texas A&M University, University of Bucharest, and University of Idaho.

Afonso S. BandeiraView profile

Professor

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +3 more

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).