Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.
Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.
Laura Anderson is an Associate Professor in the Department of Mathematics at Binghamton University. She holds a Ph.D. from MIT (1994) and has been affiliated with Binghamton since 2001. Her research focuses on Combinatorics and Topology, with a specialization in matroid theory, hyperplane transversals, and topological combinatorics. She teaches advanced courses such as Introduction to Combinatorics (Math 511) and Discrete Mathematics (Math 314). Her academic contributions include groundbreaking work on oriented matroids, combinatorial Grassmannians, and hyperfield applications. Anderson has advised multiple Ph.D. students, including Olakunle Abawonse, Ulysses Alvarez, and Leandro Junes, whose theses explore topics like matroid extensions and tropical phased matroids. She actively participates in academic conferences, co-organizing the Binghamton University Graduate Conference in Algebra and Topology (BUGCAT). Anderson’s research integrates algebraic topology with discrete mathematics, addressing geometric realizations, hyperfield structures, and topological invariants. Her pedagogical innovations include experimenting with flipped classroom methods in calculus education. She maintains an active presence in academic service, contributing to journal reviews and editorial work in combinatorial geometry.
Kenneth J. Falconer is the Regius Professor of Mathematics at the University of St Andrews, where he is a member of the School of Mathematics and Statistics and the Analysis Research Group. He has held prestigious positions at the University of Bristol and Corpus Christi College, Cambridge, and has been a visiting professor at institutions including Oregon State University and the Australian National University. Regius Professor of Mathematics, University of St Andrews (2017–present) Professor of Mathematics, University of St Andrews (1993–2017) Reader, University of Bristol Lecturer, University of Bristol Research Fellow, Corpus Christi College, Cambridge His research centers on fractal and multifractal geometry, geometric measure theory, and related fields. He has made seminal contributions to the understanding of fractal projections, dimensional analysis of self-affine sets, and fractal processes. His work includes the concept of the digital sundial and the introduction of the affinity dimension and Falconer’s distance problem. His research spans dimensional analysis, random fractals, PDEs on fractal domains, and combinatorial geometry. The most recent publications show a sustained focus on intermediate dimensions, projections of fractal sets and measures, and the dimensional properties of stochastic processes. His work frequently involves collaboration with leading mathematicians and appears in top journals such as Transactions of the American Mathematical Society , Ergodic Theory and Dynamical Systems , and Journal of Fractal Geometry . Fellow of the Royal Society of Edinburgh (1998) Shephard Prize, London Mathematical Society (2020) CBE, King’s New Year’s Honours (2024) Kenneth Falconer has supervised numerous students and collaborated with many researchers including Jonathan Fraser, Pertti Mattila, and Xiong Jin. He has served on editorial boards for Fractals , Journal of Fractal Geometry , and Mathematical Proceedings of the Cambridge Philosophical Society . He has been active in professional service, including as Chair of the British Mathematical Colloquium 2018 and Publications Secretary of the London Mathematical Society (2006–2009). He organized major programs at the Isaac Newton Institute and Mittag-Leffler Institute. He is also known for his involvement in the Long Distance Walkers Association, where he served as Chairman and Editor of Strider , and for his mathematical poetry featured in publications like the London Mathematical Society Newsletter .
Marco Castronovo serves as an Assistant Professor in the Mathematics Department at Columbia University, with his office located in Mathematics Hall 614. His academic work bridges continuous and discrete mathematical structures through the lens of symplectic geometry and topology. His research focuses on Symplectic Topology , particularly exploring symplectic structures as frameworks for quantization of classical invariants. Key interests include: Developing open-string versions of Schubert calculus Investigating cluster structures in positroid varieties Constructing Landau-Ginzburg models for Grassmannians Studying Lagrangian cobordisms and exotic tori Analyzing connections between Dubrovin spectra and Fukaya algebras His recent publications reveal a consistent trajectory toward unifying symplectic geometry with combinatorial algebraic structures, particularly through Grassmannian varieties and their mirror symmetric counterparts. The work demonstrates increasing sophistication in connecting Fukaya categories with cluster algebraic frameworks, while maintaining strong ties to quantum topological invariants. As an academic mentor, Castronovo supervises undergraduate researchers including B. Basson (Barnard Summer Research Institute) and S. Kesavan (Columbia Summer Research Fellowship). He actively contributes to the mathematical community through refereeing and co-organizing the Columbia SGGTC Seminar, demonstrating commitment to both research dissemination and academic service. His computational work manifests through three significant open-source projects: Posetroids for exploring Zariski closure orders in Grassmannians, DubrovinDynamics for visualizing spectral evolution in truncated Dubrovin operators, and ClusterExplorer for conducting random walks on cluster structures of Grassmannians. These tools have become valuable resources for researchers working at the intersection of symplectic geometry and combinatorics.
David Perkinson is a Professor of Mathematics at Reed College, where he holds a position in the Department of Mathematics. His research focuses on combinatorics, algebraic geometry, and discrete mathematics, with a particular emphasis on sandpile models, graph theory, and matroid theory. He is the author of the textbook *Divisors and Sandpiles: An Introduction to Chip-Firing*, which explores the combinatorial theory of chip-firing on graphs. Perkinson has also developed software tools like the Sandpile Java App, which visualizes and analyzes the Abelian Sandpile Model. He organizes the Cascade Lectures in Combinatorics (CALICO), a series of conferences funded by the National Science Foundation, aimed at fostering collaboration among researchers in combinatorics. His work bridges discrete mathematics with algebraic geometry, emphasizing connections between graph theory and geometric structures. Perkinson teaches advanced courses in analysis and contributes to the academic community through his research on topics such as divisor theory on graphs, sandpile groups, and combinatorial game theory. His recent publications (2015–2024) address matroid theory, sandpile dynamics, and applications of algebraic methods to discrete systems.
John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
Prof. Dr. Ieke Moerdijk is a distinguished Professor of Mathematics at the Mathematical Institute of Utrecht University, part of the Faculty of Science. Previously, he held positions at Radboud University (2011–2016) and has been affiliated with institutions like the University of Chicago, Cambridge, and the University of Amsterdam, where he earned his PhD in Mathematics (1985, Cum Laude). His research focuses on algebraic and differential topology, homotopy theory, and applications of topological structures to mathematical logic. He is renowned for co-authoring influential books such as Sheaves in Geometry and Logic (with S. Mac Lane) and Introduction to Foliations and Lie Groupoids (with J. Mrcun). Moerdijk has received prestigious awards including the Spinoza Prize (2012) and the Descartes-Huygens Prize (2011), and is a member of the KNAW and Academia Europaea. His current research emphasizes the theory of dendroidal sets and homotopy operads. He has held visiting positions at institutions like Cambridge, McGill, and Sydney. His academic contributions span editorships, teaching, and supervising numerous students. Moerdijk’s work bridges foundational mathematics with advanced categorical and topological frameworks, influencing areas from algebraic geometry to logic. Education: Bachelor’s/Master’s in Mathematics, Philosophy, and Linguistics at University of Amsterdam PhD in Mathematics, University of Amsterdam (1985) Awards: Spinoza Prize (2012), Descartes-Huygens Prize (2011) Member of KNAW (2006), Academia Europaea (2014) Huygens Fellowship (1986), PIONIER Grant (1995) Research Interests: Algebraic topology, homotopy theory, operads, category theory, and mathematical logic. Moerdijk’s publications include foundational works on dendroidal sets and simplicial methods, with recent contributions addressing ∞-operads and univalent completion. His research often explores connections between algebraic structures and topological spaces, with applications to higher category theory.
Maria Rita Casali is a Full Professor at the Department of Physical, Computer and Mathematical Sciences, University of Modena and Reggio Emilia. Her research focuses on geometry, topology, and mathematical structures, particularly in relation to PL-manifolds and colored tensor models. Teaching: Courses in Geometry, Discrete Mathematics, and Linear Algebra for Engineering and Strategic Sciences degrees. Research: Investigates combinatorial invariants (regular genus, G-degree, gem-complexity) for compact 4-manifolds, linking them to quantum gravity and tensor models. Publications: Recent works include studies on trisections of 4-manifolds, classifications via colored graphs, and combinatorial properties of the G-degree. Her contributions to crystallization theory and PL-manifold representation have advanced the understanding of geometric topology and its applications in theoretical physics.
Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .
Olga Kharlampovich is a Professor at the City University of New York (CUNY), affiliated with Hunter College and the Graduate Center. She specializes in group theory and geometric group theory, with a focus on group actions on trees, Bass-Serre theory, and related algebraic structures. She taught a mini course titled 'Groups acting on trees' in May 2021, covering topics such as R-trees, Λ-trees, and structural theorems for groups acting on trees. The course was delivered virtually and included lectures on amalgamated products, HNN extensions, and applications to the elementary theory of free groups. Her research interests encompass geometric and combinatorial group theory, with contributions to Rips' theorem, ordered abelian groups, and the interplay between group actions and tree-like structures. She has collaborated on foundational papers exploring λ-trees and their role in algebraic topology and group theory. Access to her mini course was provided via Webex, with recordings available for the three lectures. The course was open to undergraduates, graduate students, faculty, and researchers interested in algebraic structures and geometric group theory.
Hannah Hoganson is an NSF Postdoctoral Fellow in the Department of Mathematics at the University of Maryland, mentored by Christian Rosendal after previously holding a Brin Postdoctoral Fellowship under Lei Chen. Her research bridges geometric group theory, low-dimensional topology, and descriptive set theory, with a focus on mapping class groups of infinite-type surfaces and topological groups. Her educational background includes a PhD from the University of Utah (2022) advised by Ken Bromberg, and prior graduate studies at Miami University where she investigated Thompson's groups. She has taught multiple calculus courses at UMD and the University of Utah, receiving exceptional student evaluations for her clarity and supportive teaching style. Hoganson's research explores the coarse geometry of mapping class groups, connections between topological groups and descriptive set theory, and geometric structures on infinite-type surfaces. Her work often combines algebraic, geometric, and topological methods to address fundamental questions about group actions and classification problems in low-dimensional topology. Her recent publications demonstrate a strong trend toward interdisciplinary approaches, integrating geometric group theory with descriptive set theory to analyze infinite-type mapping class groups and Polish groups. Key themes include geometric finiteness, coarse boundedness, and the interplay between algebraic structures and topological dynamics in infinite settings. NSF Postdoctoral Fellowship (DMS-2303365) Brin Postdoctoral Fellowship Hoganson has advised an undergraduate reading course in geometric group theory (Spring 2024) and served as a mentor for REU students at SUMSRI. Her current research is supported by NSF grant DMS-2303365, which funds her postdoctoral work on geometric and topological aspects of infinite-type surfaces and groups. She actively collaborates with researchers including George Domat, Sanghoon Kwak, and Robbie Lyman across multiple projects. She co-organizes the University of Maryland Geometry and Topology Seminar and has co-led specialized workshops including the Big Mapping Class Groups log cabin workshop in Young, AZ (2024) and the AWM special session on Women in Groups, Geometry and Dynamics (2023), fostering collaborative research environments in geometric topology.
Professor Martin Liebeck is a Professor of Pure Mathematics and Head of the Pure Mathematics Section at the Department of Mathematics, Imperial College London. He is affiliated with the Algebra and Algebraic Combinatorics research groups and is part of the Mathematics research and teaching staff within the Faculty of Natural Sciences. His research interests span Pure Mathematics, with a focus on group theory, algebraic combinatorics, Lie groups, and representation theory. His work often involves the structure and properties of finite simple groups, algebraic groups, and their applications to permutation groups and character theory. Recent publications explore topics such as the actions of simple groups, unipotent classes in algebraic groups, character ratios, and the classification of permutation groups. His work frequently intersects with combinatorial and algebraic structures, with implications for both theoretical and applied mathematics. Professor Liebeck’s contributions include foundational studies on group generation, covering numbers, and character bounds, reflecting his deep engagement with the interplay between algebraic structures and combinatorial problems. His research has been published in leading mathematics journals, and he maintains an active academic profile through his personal webpage at http://www.ma.ic.ac.uk/~mwl/ .
