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. 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.
Ş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. 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).
David Nadler is a Professor in the Department of Mathematics at the University of California, Berkeley, appointed in 2012. His research centers on geometric representation theory and symplectic geometry, with significant contributions to the Langlands program, microlocal sheaf theory, and symplectic topology. He maintains an active research group and teaches courses ranging from undergraduate linear algebra to graduate algebraic topology and geometry. Nadler's research explores the interface of algebraic geometry, topology, and representation theory. His work in geometric representation theory focuses on Langlands duality, Springer theory, and Betti geometric Langlands. In symplectic geometry, he investigates microlocal sheaves, Fukaya categories, and Weinstein structures. His recent publications demonstrate a consistent focus on categorical methods in geometric Langlands correspondence and symplectic arborealization. His publications consistently emphasize categorical and geometric approaches to representation theory. Recent works cluster in three areas: (1) extensions of the geometric Langlands program to Betti cohomology settings, (2) microlocal analysis of sheaves on symplectic manifolds, and (3) combinatorial models in symplectic topology. This reflects sustained development of 'Betti geometric Langlands' as a distinct research program bridging topology and automorphic forms. Nadler has advised over a dozen PhD students since 2012, with dissertations spanning geometric representation theory, symplectic geometry, and algebraic topology. Student projects frequently investigate categorical aspects of geometric Langlands, microlocal sheaves, and combinatorial models in symplectic topology.
Jan de Gier is a Professor at the School of Mathematics and Statistics, The University of Melbourne . He is also the Founding Director of MATRIX , Australia’s residential research institute in the mathematical sciences, and a former Deputy Director and Chief Investigator in the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) . Additionally, he co-founded the Australian and New Zealand Association for Mathematical Physics (ANZAMP) in 2011 and served as its inaugural Chair. His research focuses on solvable lattice models at the intersection of mathematical physics and statistical mechanics . Key areas include the application of quantum integrability , algebraic structures like the Yang-Baxter equation, Hecke algebras, and quantum groups, as well as analytical methods such as complex analysis and elliptic curves. His work bridges pure and applied mathematics through connections between enumerative combinatorics , representation theory , and real-world phenomena like traffic flow modeling via exclusion processes . The 15 most recent articles reflect his expertise in integrable systems , non-equilibrium statistical mechanics , and algebraic combinatorics . Topics span Macdonald polynomials , stochastic duality , quantum spin chains , and traffic modeling , with methodologies involving matrix product forms , exact solutions , and critical phenomena analysis. He has contributed to editorial efforts through the AustMS Gazette and MATRIX Annals, and has been involved in public science communication via opinion pieces on mathematics funding and applications. His work emphasizes the importance of fundamental research in driving technological innovation, as highlighted in media articles discussing pi calculation , zero-knowledge proofs , and mathematics education .
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.
David E Speyer is a Professor in the Department of Mathematics at the University of Michigan . His research focuses on algebraic problems with combinatorial flavors , particularly in tropical geometry , cluster algebras , and geometry of Lie groups . He has supervised multiple PhD students, including Shelby Cox, Will Dana, and John Wiltshire-Gordon, and collaborated on projects with undergraduates like Grant Barkley and Benjamin Branman. Education: PhD in Mathematics from UC Berkeley under Bernd Sturmfels; undergraduate at Harvard. Research: Key areas include tropical geometry , cluster algebras , and flag manifolds . His work often bridges combinatorics, algebraic geometry, and representation theory. Publications: Over 40 papers, including breakthroughs in cluster algebras , affine weak order , and braid variety cluster structures . Awards: Clay Research Fellow (2005-2010). Teaching: Coordinates courses like Math 593 (graduate algebra) and Math 214 , with a focus on inquiry-based learning .
Avi Wigderson is the Herbert H. Maass Professor in the School of Mathematics at the Institute for Advanced Study, Princeton. He is a leading authority in theoretical computer science, particularly computational complexity theory. Wigderson organizes the Computer Science and Discrete Mathematics (CSDM) program at the Institute, fostering interdisciplinary research at the intersection of mathematics and computer science. Wigderson earned his Ph.D. (1983), M.A. (1982), and M.S.E. (1981) from Princeton University. Prior to his current position, he held appointments at The Hebrew University of Jerusalem (1986-2003), Princeton University (1990-1992), Mathematical Sciences Research Institute, Berkeley (1985-1986), IBM Research (1984-1985), and University of California, Berkeley (1983-1984). Wigderson's research spans computational complexity theory, randomness and computation, algorithms and optimization, circuit complexity, proof complexity, quantum computation and communication, and cryptography. His work explores fundamental questions like whether mathematical creativity can be automated (P vs NP problem), the security of electronic commerce, the role of randomness in computation, and the potential of quantum mechanics to enhance computation. He has made significant contributions to understanding the power and limitations of efficient computation. Analysis of Wigderson's recent publications reveals a strong focus on optimization, complexity theory, and their mathematical foundations. His work connects diverse areas including non-commutative algebra, geometric complexity, graph theory, and quantum computing. A recurring theme is exploring whether fundamental computational problems like P vs NP can be addressed through optimization techniques such as gradient descent. His research shows increasing interdisciplinary connections between theoretical computer science, mathematics, and physics. ACM A.M. Turing Award (2023) Abel Prize (2021) Donald E. Knuth Prize (2019) Gödel Prize (2009) American Mathematical Society's Levi L. Conant Prize (2008) Rolf Nevanlinna Prize (1994) Yoram Ben-Porat Presidential Prize for Outstanding Researcher (1994) Bergman Fellowship (1989) Member, American Academy of Arts and Sciences Member, National Academy of Sciences While specific details about Wigderson's students are not provided in the source material, his extensive lecture series, workshops, and program organization suggest significant mentorship activities. His book "Mathematics and Computation" published by Princeton University Press serves as an educational resource for students and researchers. Wigderson has organized major programs at the Institute for Advanced Study including "Lower Bounds in Computational Complexity" (2018) and "Pseudorandomness" (2017), creating research opportunities for numerous scholars. Wigderson leads the Computer Science and Discrete Mathematics (CSDM) program at the Institute for Advanced Study, which brings together researchers from mathematics and computer science to explore fundamental questions in computation. His work with collaborators across multiple institutions has established connections between theoretical computer science and diverse fields including quantum information theory, algebraic geometry, and optimization. Recent projects focus on non-commutative optimization and its applications to computational complexity problems.
Michael Anshelevich is a Professor of Mathematics at Texas A&M University, affiliated with the College of Arts & Sciences. His research focuses on Functional Analysis, Operator Theory, and Free Probability, with contributions to non-commutative stochastic processes, orthogonal polynomials, and operator-valued distributions. He holds a Ph.D. from the University of California, Berkeley (2000) and a B.S. from the California Institute of Technology (1994). His work bridges combinatorial methods with advanced probability theory, addressing topics like free Lévy processes and free convolution powers. Research interests span non-commutative probability frameworks, including free stochastic measures, Fock space representations, and applications of combinatorial structures to stochastic calculus. Recent articles explore exponential products in operator algebras, Hermite polynomials in Brownian motion contexts, and depth-two actions in Fock spaces. His contributions to free probability include extending classical limit theorems to non-commutative settings and analyzing multiplicative free convolutions. Publications highlight interdisciplinary connections between functional analysis and stochastic processes, with a focus on operator-valued distributions and Jacobi parameters. While no specific awards are listed, his extensive bibliography reflects sustained impact in mathematical physics and operator theory. Advising and grants sections remain unspecified, though his research often involves collaborative projects in stochastic analysis and free probability.
Gregory G. Smith is a Professor in the Department of Mathematics and Statistics at Queen's University, affiliated with the Faculty of Arts and Science. His research focuses on algebraic geometry, commutative algebra, and symbolic computation, with a particular interest in the interplay between positivity, convexity, and combinatorial structures. He holds a B.ScH from Queen's University, an MA from Brandeis University, and a PhD from the University of California, Berkeley. His research contributions include work on Hilbert schemes, toric varieties, and computational algebra, with publications in top-tier journals such as the Journal of the American Mathematical Society and Compositio Mathematica . He has received prestigious awards, including the Coxeter-James Prize (2012) and the André-Aisenstadt Prize (2007). Smith is also an editor of the Journal of Software for Algebra and Geometry . He has advised multiple graduate students, including Sasha Zotine (PhD 2024) and Benjamin Hersey (PhD 2021). His teaching spans undergraduate and graduate courses in algebra, geometry, and combinatorics, emphasizing rigorous mathematical reasoning and computational tools.
Kirsten Wickelgren is a Professor in the Department of Mathematics at Duke University, affiliated with Trinity College of Arts & Sciences. Her research focuses on homotopy theory and arithmetic geometry, with support from the National Science Foundation through grants DMS-2405191 and DMS-2103838. She has held academic positions at Duke, Georgia Tech, and Harvard, teaching advanced courses in algebraic topology, algebra, and geometry. Her research explores intersections of algebraic topology and number theory, including motivic homotopy theory, quadratic forms, and enumerative geometry. Notable contributions include enriched counts of geometric objects over finite fields and arithmetic counts of curves in projective spaces. Wickelgren has advised numerous PhD students, including Chongyao Chen, Cameron Darwin, and Thomas Brazelton, and has mentored undergraduate and high school research projects. She has organized conferences such as the Abel Symposium 2025 and co-organized the Mathematics Employment Experience for High School Students at Duke.
Cynthia Vinzant is an Associate Professor in the Department of Mathematics at the University of Washington. Her research focuses on real algebraic geometry, combinatorics, and convex optimization, with applications to hyperbolic polynomials, determinantal representations, and convex algebraic geometry. She collaborates extensively on projects involving numerical ranges, quasicrystals, and geometric optimization problems. Research Interests: Real algebraic geometry and its connections to combinatorics and optimization Hyperbolic and log-concave polynomials Convex geometry and spectrahedra Applications in matrix analysis and statistical mechanics Her work spans theoretical advances in algebraic geometry and computational methods, including contributions to the study of principal minors, tropical geometry, and phase retrieval problems. Recent publications highlight her focus on Fourier quasicrystals, higher-rank numerical ranges, and combinatorial structures in matroids. Publications: Over 30 peer-reviewed articles, including influential works on quartic curves, determinantal representations, and log-concave polynomials. Grants & Collaborations: Active in interdisciplinary research, with projects supported by NSF and collaborations in algebraic combinatorics and geometric optimization.
Christopher Manon is an Associate Professor in the Department of Mathematics at the University of Kentucky, within the College of Arts & Sciences. His research focuses on algebraic geometry, tropical geometry, and their connections to combinatorics, representation theory, and phylogenetics. He explores topics such as toric varieties, vector bundles, Bruhat-Tits buildings, and geometric compactifications. Manon's work frequently intersects with combinatorial structures like matroids, polytopes, and phylogenetic networks. His studies on toric vector bundles and tropical geometry have advanced understanding of degenerations and moduli spaces. He has contributed to the theory of Fano varieties and Gorenstein polytopes, linking algebraic geometry with lattice theory and mirror symmetry. His recent research trends emphasize geometric families of degenerations via polytope mutations, invariants in phylogenetic models, and equivariant cohomology in arithmetic contexts. Collaborative projects include work on frame theory and conformal blocks in representation theory. Manon's research has been supported through collaborative grants, including projects on combinatorial buildings and tropical geometry. His work bridges pure mathematics disciplines such as algebraic geometry, combinatorics, and representation theory, often with applications to geometric modeling and theoretical biology.
Marcelo Fiore is a Professor in Mathematical Foundations of Computer Science at the Department of Computer Science and Technology, University of Cambridge, and a Fellow of Christ's College. His research spans category theory, lambda calculus, equational logic, type theory, and mathematical structures in computer science. University: University of Cambridge Department: Department of Computer Science and Technology Academic Rank: Professor College Affiliation: Christ's College Fiore's work focuses on the intersection of category theory and computer science, particularly in abstract syntax, denotational semantics, and algebraic structures. Recent publications explore combinatorial models, normalization by evaluation, and homotopy type theory applications. 2025: Creation/annihilation operators in mathematical structures 2024: Lawvere theories in toposes and differential linear logic 2023: Homotopy type theory and normalization frameworks 2022: Second-order abstract syntax formalization and quotient types Fiore has advised PhD students including N. Arkor (2022) and O.M. Elsayed (2011), who researched monadic structures and second-order algebraic theories respectively. He contributes to departmental initiatives such as the Accelerate Programme for Scientific Discovery and Data Trusts Initiative at Cambridge.
