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.
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.
Sergio Bermudo Navarrete is a Professor at the Department of Economics, Quantitative Methods and Economic History, Universidad Pablo de Olavide. His research spans combinatorics, graph theory, and operator theory. Education: PhD in Mathematics (2003, University of Seville) with thesis on functional models of operators in Hilbert spaces. Research Interests: Focus on graph theory, domination problems, topological indices, and operator theory. Publication Trends: Recent work includes vertex-degree-based indices for oriented graphs, domination parameters in product graphs, and differential analysis of line graphs. Keywords span Computer Science , Mathematical Chemistry , and Operations Research . Collaborations: Frequent co-authors: José María Sigarreta Almira, José Manuel Rodríguez García, Juan Alberto Rodríguez-Velazquez. Contact: Email sbernav@upo.es .
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.
Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.
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.
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.
Vera Fischer is an Associate Professor and Privatdozent in the Department of Mathematics at the Faculty of Mathematics, University of Vienna. She has been an active researcher since 2008, with a strong publication record in mathematical logic and set theory. Her research centers on set-theoretic combinatorics , focusing on cardinal characteristics of the continuum, forcing, definability, and structures such as maximal almost disjoint families, cofinitary groups, and independent families. She investigates foundational questions in independence, spectra of combinatorial objects, and the interplay between definability and generic extensions. Her work often involves constructing models to separate cardinal invariants or to realize specific spectra under forcing. The recent publications show a consistent trend in combinatorial set theory , with a focus on tower spectra, tight families, mad families, and their behavior under various forcing notions like Cohen and Sacks forcing. Her research frequently explores the definability and destructibility of combinatorial families, often in collaboration with leading researchers such as Corey B. Switzer, Stefan Geschke, and Saharon Shelah. FWF START Prize, 2017 Förderungspreis der ÖMG, 2018 Förderungspreis, 2018 She leads and participates in research projects such as Comparing the Real Line to Combinatorics of the Uncountable and A Sacks-like model with large continuum , indicating active grant funding and supervision of research activities. She also organizes academic events like Colloquium Logicum and engages in public outreach on topics like infinity. Her research is conducted within the Set Theory Group at the University of Vienna, where she collaborates with other logicians and contributes to the academic community through publications, conferences, and mentorship.
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.
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.
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.
Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.
Prof. Dr. Tobias Dyckerhoff is a Professor of Mathematics at the University of Hamburg , specializing in Higher Structures in Algebra and Geometry . He is affiliated with the Cluster of Excellence "Quantum Universe" and the Center for Mathematical Physics . His academic career includes positions at the University of Bonn, University of Oxford, Yale University, and the University of Pennsylvania. Research Interests : Higher category theory, homological algebra, perverse sheaves, Fukaya categories, and applications to symplectic geometry and quantum topology. Editorial Roles : Managing Editor of Abhandlungen aus dem mathematischen Seminar der Universität Hamburg (since 2023) and Editor of Applied Categorical Structures (since 2023). Publications & Articles focus on advanced topics like stable ∞-categories, spherical functors, and Calabi-Yau structures. Notable trends include interconnections between algebraic topology, category theory, and symplectic geometry. Scientific Awards : Bonn Junior Fellow (2014–2018) Titchmarsh Postdoctoral Fellow (2013–2014) Simons Postdoctoral Fellow (2010–2013) Students & Collaborations : Mentors active researchers like Angus Rush, Till Heine, and Jonte Gödicke. Collaborates with institutions such as MPI Bonn and international experts in higher structures.
Prof. Dr. Franziska Jahnke is a Professor in the Faculty of Mathematics and Computer Science at the University of Münster, affiliated with the Institute for Mathematical Logic and Foundational Research. She specializes in model theory and its applications to algebra, particularly valued fields, set theory, and arithmetic definability. Her research bridges foundational mathematics and algebraic structures, with a focus on henselian valuations, NIP fields, and combinatorial aspects of valued fields. Education: Diplom in Mathematics from Albert-Ludwigs-Universität Freiburg (2009), DPhil in Mathematics from the University of Oxford (2013). Academic roles include Junior Professor at Münster (2017–2024), and a visiting position at the University of Amsterdam (2023–2024). Research Interests: Model theory of fields, arithmetic definability of valuations, perfectoid fields, and connections to infinite combinatorics. Key contributions include work on Ax-Kochen-Ershov principles, NIP fields, and classification conjectures in strongly dependent fields. Recent Activities: Organized workshops on non-archimedean geometry and model theory of valued fields. Recipient of the Teaching Prize 2022 and a fellow of the Daimler und Benz Stiftung. Deputy Equal Opportunity Representative in her department. Supervision: Advised multiple PhD students (e.g., Blaise Boissonneau, Simone Ramello) and postdocs. Taught courses on algebra, logic, and model theory, including lectures on valued fields and stability theory.
Diego Garlaschelli is Professor of Theoretical Physics at the IMT School for Advanced Studies in Lucca, Italy, and at the Lorentz Institute for Theoretical Physics, University of Leiden, the Netherlands. He leads the NETWORKS research unit at IMT and the Econophysics and Network Theory group at Leiden. He is also an external faculty member at the Complexity Science Hub in Vienna and an associate member of the Enrico Fermi Research Center in Rome. His affiliations reflect a strong international and interdisciplinary research profile in network science and statistical physics. He holds a master's degree in theoretical physics from the University of Rome III (2001) and a PhD in Physics from the University of Siena (2005). His postdoctoral experience includes positions at the Australian National University, the University of Siena, the University of Oxford, and the Sant’Anna School of Advanced Studies in Pisa. Garlaschelli’s research spans network theory, statistical physics, econophysics, financial complexity, ecological networks, and social dynamics. He applies maximum entropy models, information theory, and random graph frameworks to understand complex real-world systems. His teaching includes courses in Network Theory, Econophysics, and Complex Systems at both PhD and MSc levels. The 15 most recent publications highlight a consistent focus on network reconstruction, ensemble inequivalence, renormalization, and applications to financial and socio-economic systems. Key themes include statistical inference in networks, resilience, and multi-scale modeling, with publications in top journals such as Nature Reviews Physics , Physics Reports , Science , and Physical Review Letters . His scientific awards include the Best Paper Award at the 6th International Workshop on Self-Organizing Systems (2012) and the Jan Kijne Prize (2013) as supervisor. He has secured multiple grants from NWO, the European Union, and the Royal Society, and has supervised over 40 students at PhD, master’s, and bachelor’s levels. He also mentors postdocs and visiting scientists. Garlaschelli leads and organizes major international workshops and schools in network science and complex systems. He serves on scientific committees and is an active referee for journals like Nature and Physical Review Letters , as well as funding agencies including the ERC and NWO.
