Johnny Guzmán is a Professor of Applied Mathematics at Brown University, specializing in numerical analysis of partial differential equations and scientific computing. He holds a Ph.D. in Applied Mathematics from Cornell University (2005) and a B.S. in Mathematics from California State University, Long Beach (1999). His research focuses on numerical methods for PDEs, including discontinuous Galerkin methods, mixed finite element methods, and fluid-structure interaction problems. Key contributions include work on hybridizable and mixed finite element methods, discontinuous Galerkin discretizations, and stability analysis of numerical schemes. He has been funded by multiple NSF grants, including a Postdoctoral Fellowship (2005–2008) and awards totaling over $1M in research support. Notable recognitions include the Comfort and Urry Family Fund Prize (2013). Guzmán collaborates with institutions globally and serves on editorial boards for journals like Journal of Numerical Mathematics and Calcolo . His teaching spans computational linear algebra, numerical methods for differential equations, and finite element analysis.
Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.
Prof. Dr. Philipp Habegger is a faculty member at the University of Basel's Department of Mathematics and Computer Science . His research focuses on Number Theory , specifically Diophantine Geometry, heights on abelian varieties, unlikely intersections, and algebraic number theory. He leads the Research Group in Number Theory and participates in collaborative seminars like the Number Theory Web Seminar with Mike Bennett and Alina Ostafe. Contact : philipp.habegger@unibas.ch | +41 61 207 26 98 Office : Spiegelgasse 1, 4051 Basel, Switzerland Academic Role : Research and teaching in number theory and Diophantine problems Research Overview Habegger's work addresses fundamental questions about the distribution of special points on algebraic varieties and the arithmetic properties of polynomial dynamics. His recent publications analyze degeneracy loci in abelian families, canonical heights, and the geometric Bogomolov conjecture. The 15 most recent articles reflect a focus on number theory, algebraic geometry, and effective bounds in Diophantine problems. Scientific Collaborations Collaborated with Ziyang Gao, Harry Schmidt, Umberto Zannier, and others Contributed to journals: Annals of Mathematics , Forum of Mathematics, Sigma , Compositio Mathematica Key themes: Abelian varieties , Heights , Unlikely intersections , CM jacobians
Sergei Gukov is the John D. MacArthur Professor of Theoretical Physics and Mathematics at the California Institute of Technology (Caltech), where he has been a faculty member since 2005. He serves in the Division of Physics, Mathematics and Astronomy, with primary affiliation in the Department of Mathematics. His research bridges the fields of mathematics and theoretical physics, focusing on deep connections between geometry, topology, and quantum field theory. Gukov received his B.S. from Moscow Institute of Physics and Technology in 1997, followed by an M.S. and Ph.D. from Princeton University in 2001. He joined Caltech as an Associate Professor in 2005, was promoted to Professor in 2007, and was named the John D. MacArthur Professor in 2021. His research spans several interconnected areas at the frontier of mathematics and physics. A central theme is the exploration of quantum topology and its connections to mathematical physics. He has made significant contributions to the geometric Langlands program, gauge theory, and the categorification of knot and 3-manifold invariants. His recent work increasingly incorporates machine learning approaches to mathematical problems, reflecting his interest in the intersection of traditional mathematical research and modern computational techniques. Gukov's work often reveals deep connections between seemingly disparate areas of mathematics and physics, such as the relationship between Rozansky-Witten geometry and Coulomb branches in supersymmetric gauge theories. Gukov's publications demonstrate a consistent focus on the mathematical structures underlying quantum field theories and their topological implications. His recent work shows an increasing emphasis on computational approaches to mathematical problems, particularly through his interest in mathematics and machine learning. The recurring themes across his research include the application of physical insights to solve mathematical problems and the discovery of new mathematical structures through physical reasoning. He serves on the editorial boards of several prestigious journals including the Journal of Knot Theory and Its Ramifications, Communications in Mathematical Physics, and Letters in Mathematical Physics. Gukov is also active in the academic community, having delivered plenary talks at major conferences such as the First International Congress of Basic Science and presenting at String Math 2023 on the potential impact of AI on mathematical research. Gukov teaches Ma 146 ab, Introduction to Knot Theory and Quantum Topology, a course that reflects his research interests. He also runs a seminar on Mathematics and Machine Learning, held Tuesdays from 2-3pm in East Bridge Conference room 114, demonstrating his commitment to fostering interdisciplinary research at the intersection of mathematics and computational methods.
Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.
Chan Song Heng is an Associate Professor in the Division of Mathematical Sciences at the School of Physical and Mathematical Sciences, Nanyang Technological University (NTU), Singapore. He has been affiliated with NTU since 2007. His academic journey includes a B.Sc. (Hons) in Mathematics from the National University of Singapore (2001) and a Ph.D. in Mathematics from the University of Illinois at Urbana-Champaign (2005). His research focuses on advanced mathematical topics such as partition theory, q-series, mock theta functions, and number theory. Recent work includes studies on identities analogous to Jacobi, Fermat-Wilson theorems, and applications of Rogers-Fine identities. His publications explore combinatorial, analytic, and algebraic aspects of these fields, with notable contributions to modular forms, theta functions, and partition congruences. Dr. Chan’s articles often intersect with classical problems in mathematics, blending historical insights with modern analytical techniques. Notable themes include exploring identities through modular forms, analyzing partition statistics (ranks/cranks), and studying mock theta functions. Despite his prolific output, no specific scientific awards or student advisees are listed in the provided materials.
Greta Panova is a Gabilan Distinguished Professor of Science and Engineering and a Professor of Mathematics at the University of Southern California (USC). Her research focuses on Algebraic Combinatorics, with connections to representation theory, statistical mechanics, probability, and computational complexity theory. She also engages in molecular biology modeling. Panova holds editorial roles at journals including the Electronic Journal of Combinatorics, Arnold Mathematical Journal, and Communications of the American Mathematical Society. She is a writer/editor for the Putnam Mathematical Competition (2023-2025) and is currently supported by NSF grants in the CCF division. Her research interests span Algebraic Combinatorics, Representation Theory, Statistical Mechanics, Probability, and Computational Complexity Theory. Specific areas include Kronecker and Littlewood-Richardson coefficients, asymptotic behavior of combinatorial structures, and the interplay between algebraic structures and computational complexity. She also explores applications in molecular biology, particularly protein dynamics in DNA lesions. NSF grants in CCF division (current) Editorial roles at Electronic Journal of Combinatorics, Arnold Mathematical Journal, and others Contributor to the Putnam Mathematical Competition Panova's research is supported by NSF grants, focusing on computational complexity and algebraic combinatorics. She has advised students in areas related to her research, though specific names aren’t listed here. Grants have funded explorations into geometric complexity theory, asymptotic combinatorics, and molecular biology modeling. Her work involves collaborations across disciplines, including statistical mechanics and integrability, as highlighted in her white paper contributions.
Mohit Singh is the Coca-Cola Foundation Professor at the H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology. He previously held positions at Microsoft Research (2011-2016) and as an Assistant Professor at McGill University (2010-2012). PhD in Algorithms, Combinatorics, and Optimization (ACO) at Carnegie Mellon University His research focuses on discrete optimization , approximation algorithms , and convex optimization , with applications to combinatorial optimization, submodular functions, and network design. He has contributed to topics like Sticky Brownian Rounding, integrality gaps, and online adaptive algorithms. His recent work includes theoretical advancements in matroid constraints, dimensionality reduction, and submodular maximization. He has published extensively in top conferences such as FOCS, SODA, ICML, and NeurIPS. He has been recognized with the Coca-Cola Foundation Professorship and served as Director of the Algorithms and Randomness Center at Georgia Tech (2019-2023). He has also held editorial roles and organized key academic workshops like the Bellairs Workshop on Approximation Algorithms (2011). His teaching includes advanced courses on approximation algorithms, combinatorial optimization, and linear inequalities. He has collaborated with institutions such as Microsoft Research and McGill University.
Garnet K. Chan is the Bren Professor of Chemistry and Director of the Rudolph A. Marcus Center for Theoretical Chemistry at the California Institute of Technology. He received his B.S. from the University of Cambridge in 1996 and his M.A. and Ph.D. from the University of Cambridge in 2000. Dr. Chan's research lies at the interface of theoretical chemistry, condensed matter physics, and quantum information theory, focusing on quantum many-particle phenomena and the numerical methods to simulate them. His group has developed numerous methodologies including density matrix renormalization and tensor network algorithms, canonical transformation-based down-foldings, local quantum chemistry methods, quantum embeddings, and new quantum Monte Carlo algorithms. His work addresses problems that appear naively exponentially hard but where understanding of physics, particularly entanglement structure, allows for calculations of polynomial cost. Analysis of his recent publications reveals a strong focus on quantum simulation techniques, particularly tensor network methods applied to strongly correlated systems. His research spans fundamental theoretical developments to practical applications in quantum computing, molecular simulation, and materials science, with increasing integration of machine learning techniques and GPU acceleration in computational chemistry frameworks. Dr. Chan leads an active research group at Caltech dedicated to simulating chemical and physical systems at the level of many-particle quantum mechanics. His group has welcomed numerous researchers including Kasra Hejazi, Zuxin Jin, Zhihao Cui, Ke Liao, Henrik Larsson, and Wenyuan Liu. He teaches courses in Physical Chemistry (Ch 21 abc) and Advanced Quantum Chemistry (Ch 225), contributing significantly to theoretical chemistry education at Caltech.
Nicole Wein is an Assistant Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan, where she is a member of the Theory of Computation Lab within the Computer Science and Engineering Division. Her research focuses on theoretical computer science, particularly graph algorithms and lower bounds across various domains including distance-estimation, dynamic, parameterized, distributed, and online algorithms. Education: PhD in Computer Science from MIT, advised by Virginia Vassilevska Williams Master's in Computer Science from Stanford University B.S. in Computer Science/Mathematics from Harvey Mudd College Nicole's research centers on theoretical aspects of graph algorithms and computational complexity. She investigates fundamental questions about how algorithms can efficiently handle changing data, extract information from graphs in linear time, and understand the structure of shortest paths, especially in directed graphs. Her work spans multiple algorithmic paradigms including dynamic algorithms that adapt to changing inputs, parameterized approaches for hard problems, and fine-grained complexity that establishes precise relationships between problem difficulty. Analysis of Nicole's recent publications reveals a strong focus on graph algorithms, particularly shortest path problems, spanners, and hardness results. Her work often bridges theoretical insights with practical implications, developing novel techniques for distance estimation, dynamic graph processing, and approximation algorithms. A significant portion of her research examines the structural properties of graphs that enable or constrain efficient computation, with applications across computer science. Nicole actively mentors students at various levels. She currently advises PhD student Jubayer Nirjhor and has worked with undergraduate researchers including Sam Hiken (now a pre-doc at MIT), Michael Wang, and Tony Zhang. Her teaching includes foundational courses like EECS 376: Foundations of Computer Science and specialized courses such as EECS 598: Graph Algorithms. Nicole contributes to the academic community through service as a program committee member for major conferences including SOSA 2025, FOCS 2025, SODA 2025, and others. She co-organized the June 2023 DIMACS workshop on Modern Techniques in Graph Algorithms and previously organized Algorithms Office Hours at MIT to improve communication between theory and applications of algorithms.
Patrick Ingram is an Associate Professor at the Department of Mathematics and Statistics , Faculty of Science , York University . His research focuses on number theory and diophantine geometry , particularly the arithmetic of elliptic curves and surfaces , and dynamical systems over global fields . His scholarly work includes significant contributions to the study of canonical heights , post-critically finite maps , and primitive divisors in arithmetic dynamics . His research often bridges complex dynamics with number theory, exploring the interplay between Galois representations , Drinfeld modules , and polynomial iterations . Patrick has received the Top Cited Article 2007 - 2011 award from the Journal of Number Theory . He collaborates with leading mathematicians in arithmetic dynamics, including Joseph H. Silverman , and has published extensively in top-tier journals such as the Duke Mathematical Journal , Proceedings of the London Mathematical Society , and Transactions of the American Mathematical Society . His work spans both theoretical advancements and computational techniques in algebraic divisibility sequences and rigidity theorems .
Eddie C. Red is an Associate Professor of Mathematics and Computational Sciences at Morehouse College , where he currently serves as the Interim Dean of the Science, Technology, Engineering, and Mathematics (STEM) Division. He earned his B.S. from Morehouse College (class of 2000) , followed by his M.S. and Ph.D. from Florida Agricultural and Mechanical University . Dr. Red also completed post-doctoral education at Lawrence Berkeley National Laboratory . Interim Dean, STEM Division Former Chair, Mathematics and Computational Science Division Former Chair, Physics & Dual-Degree Engineering Department Dr. Red’s research interests bridge atomic physics, quantum mechanics, and computational modeling , with a focus on: Photoionization cross-sections Bound states in the continuum Velocity map imaging techniques Mathematical formulations for quantum operators His work has resulted in publications in Physical Review A, Communications Physics, and the Journal of Physics B , alongside numerous conference presentations. Dr. Red has led the NuMaSS (Nuclear, Materials, and Space Science) Summer Enrichment Program for K-12 students and directed the Research Experience with Diversification Laboratory , emphasizing student training and research. Scientific awards include: Principal Investigator for Department of Energy National Nuclear Security Administration awards Dr. Red has served on multiple faculty governance committees, including the Admissions Committee , Faculty Grievance Committee , and Faculty Research Committee .
Tim Browning is a Professor of Number Theory at the Institute of Science and Technology Austria (IST Austria). He leads the Browning Group, focusing on analytic number theory and its interfaces with algebraic geometry. His research addresses Diophantine equations, rational points on algebraic varieties, and the distribution of arithmetic objects. He organizes the Algebraic Geometry & Number Theory Seminar and the Women in Math Day. Previously, he held roles at the University of Bristol and University of Oxford. He has authored over 100 publications and received accolades including the Ferran Sunyer i Balaguer Prize and an ERC Starting Grant. His group includes PhD students and postdocs working on topics like rational points, sieve methods, and arithmetic statistics. Education: PhD in Mathematics, University of Oxford (2002) Postdoctoral Fellowships at University of Oxford and Université de Paris-Sud Research Interests: Analytic and arithmetic methods in number theory, Diophantine geometry, rational points on varieties, circle method, sieve theory, and arithmetic statistics. His work often combines geometric and analytic techniques, such as the circle method and algebraic geometry to solve problems like Manin's conjecture and the distribution of solutions to polynomial equations. Grants & Leadership: ERC Starting Grant (2012) Serves on editorial boards of journals like Compositio Mathematica and Commentarii Mathematici Helvetici Organizes international conferences and workshops Labs/Teams: Leads the Browning Group at IST Austria, which includes postdocs and PhD students working on number theory and algebraic geometry. Collaborates with researchers globally on topics like the arithmetic of Fano varieties and rational curves.
Stuart Kurtz is a Professor in Computer Science and the College at the University of Chicago, and serves as Master of the Physical Sciences Collegiate Division. He holds the endowed position of George and Elizabeth Yovovich Professor. His research focuses on theoretical computer science, including computational complexity theory, randomness in computation, type theory, and formal logic. He has contributed to foundational areas such as the Berman-Hartmanis Isomorphism Conjecture and the computational properties of random sets. Kurtz is affiliated with the Theoretical Computer Science and Programming Languages Groups at the University of Chicago. He has been recognized with the 2009 Quantrell Award for teaching excellence. His service roles include Director of Undergraduate Studies and Department Chair in Computer Science. He actively mentors Ph.D. students and has advised multiple graduates in complexity theory and related fields. His academic background includes a Mathematics Ph.D. from the University of Illinois, supervised by Carl Jockusch. He approaches type theory as an intersection of formal logic and functional programming. Research interests span measure-theoretic randomness, computational logic, and complexity class separations. His recent work explores connections between theoretical computer science and interdisciplinary fields like physics and statistics. In teaching, Kurtz has instructed courses such as Formal Language Theory, Discrete Mathematics, and Honors Intro Programming. His service contributions include roles in the Computation Institute and Toyota Technological Institute at Chicago. His lab affiliations and collaborative work reflect a strong commitment to advancing theoretical foundations in computer science.
Christopher Umans is a Professor of Computer Science at the California Institute of Technology, where he serves as the William M. Coughran Jr. Leadership Chair and Executive Officer for the Department of Computing and Mathematical Sciences. He joined Caltech in 2002 as an Assistant Professor, became Associate Professor in 2008, and was promoted to Professor in 2010. He has held multiple leadership positions including Division Deputy Chair (2018-2020) and Executive Officer since 2020. His educational background includes a B.A. from Williams College (1996) and a Ph.D. in Computer Science from the University of California, Berkeley (2000), where he was advised by Christos Papadimitriou. After completing his Ph.D., he was a postdoc at Microsoft Research from 2000-2002 before joining Caltech. Professor Umans's research focuses on theoretical computer science, particularly computational complexity with an algebraic flavor. His work spans derandomization, explicit combinatorial constructions, algebraic algorithms, coding theory, and hardness of approximation. He has made significant contributions to understanding the complexity of fundamental problems like matrix multiplication through group-theoretic approaches and developing fast algorithms for generalized discrete Fourier transforms over finite groups. His recent publications reveal a strong emphasis on algebraic methods in computation, with particular focus on matrix multiplication algorithms, generalized DFTs, and polynomial factorization. His work consistently bridges theoretical computer science with deep mathematical concepts from group theory, representation theory, and algebraic combinatorics, demonstrating how these mathematical structures can yield more efficient computational methods. His scientific recognition includes the prestigious Simons Investigator in Computer Science award and the Northrop Grumman Prize for Excellence in Teaching at Caltech. Professor Umans has advised students including Chloe Ching-Yun Hsu, who received the Henry Ford II Scholar Award. His research has been supported by multiple NSF grants including 'AF: Small: Group Theory and Representation Theory in Matrix Multiplication and Generalized DFTs' and 'AF: Small: Algorithms for Matrix Multiplication, Polynomial Factorization and Generalized Fourier Transform.' He serves on numerous program committees including FOCS, STOC, and CCC, and is Vice-Chair of SIGACT (2021-24). He is an active member of Caltech's Theory Group within the Computing and Mathematical Sciences department, contributing to its research direction and mentoring junior researchers. His work often involves collaborations with researchers across institutions, as evidenced by his extensive publication record with co-authors from various universities.
