Florian Frick is an Associate Professor at Carnegie Mellon University in Pittsburgh. He received his PhD from TU Berlin and the Berlin Mathematical School, followed by postdoctoral positions at Cornell University and MSRI (Mathematical Sciences Research Institute). Research Focus : Interdisciplinary work at the intersection of combinatorics, geometry, and topology. Specific areas include chromatic numbers of hypergraphs, embeddability in geometric topology, intersection patterns of convex sets, and fair division problems. Interests : Traveling, sports, and food-related activities. Current Affiliation : Max Planck Institute for Mathematics in the Sciences (Nonlinear Algebra Research Group) as a visitor (2022).
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.
David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).
Alexander Ritter is a Professor of Mathematics at the University of Oxford, affiliated with the Mathematical Institute and Wadham College. Holding a PhD from MIT (2009), he maintains active research and teaching roles, including Michaelmas 2025 Linear Algebra instruction. Education PhD, Massachusetts Institute of Technology (MIT), 2009 Research Focus Professor Ritter specializes in symplectic topology, homological mirror symmetry, Floer theory, and Gromov-Witten theory. His work bridges symplectic geometry with algebraic geometry through quantum cohomology invariants, Fukaya categories, and spectral sequence techniques. Key innovations include filtrations on quantum cohomology using C*-actions and Morse-Bott-Floer theory to analyze semiprojective toric manifolds and singularities. Publication Evolution Recent publications (2023-2025) reveal intensified collaboration with Filip Živanović on quantum cohomology filtrations, yielding eight joint papers. This work integrates Hilbert-Poincaré series, equivariant cohomology, and McKay correspondence applications, demonstrating progression from foundational symplectic cohomology (2009-2013) toward geometric topology and birational geometry implications. Honors and Recognition Junior Research Fellowship, Trinity College, Cambridge (2009-2013) Research Fellowship, MIT (2007-2008) McCormick Fellowship, University of Chicago (2004-2006) Rouse Ball Prize & Heilbronn Prize, Trinity College, Cambridge (2003) Senior/Junior Scholarships, Trinity College, Cambridge (2001-2002, 2023) Research Funding As Principal Investigator for EPSRC grant EP/Z535977/1 (2025-2028; £806K), he leads research on "Orbifold Floer cohomology and birational geometry." Previously, he served as Co-Investigator with Dominic Joyce on EPSRC grant EP/T012749/1 (2019; £653K) exploring Bridgeland stability in Fukaya categories of Calabi–Yau 2–folds. Academic Environment Based in Oxford's Geometry research group, Ritter collaborates extensively within symplectic topology networks. His 2022-2023 Visiting Associate Professorship at Stanford University underscores international recognition, while consistent teaching of advanced courses (e.g., Morse homology, Algebraic Topology) reflects commitment to graduate education.
Vadim Lozin is a Professor of Mathematics at the University of Warwick, affiliated with the Department of Mathematics within the School of Mathematics. His research interests span graph theory, combinatorics, and discrete mathematics, focusing on areas such as clique-width, Ramsey numbers, and structural graph theory. He has held visiting positions at institutions including the Université Paris-Dauphine, EPFL, and KAUST. Lozin has received several accolades, including the Best Paper Award for 'Linear Ramsey numbers' in 2018 and a 2024 award at the International Symposium on Algorithms and Computation. His work involves collaborations with global researchers and contributions to conferences like IWOCA and WG. Lozin serves on editorial boards for journals such as Discrete Applied Mathematics and Electronic Notes in Discrete Mathematics . His research explores foundational problems in graph theory, with applications in algorithm design and complexity analysis. Lozin’s publications include studies on union-closed sets, functional graph properties, and algorithmic approaches to graph parameters. He has also contributed to books like Words and Graphs , bridging formal language theory with graph structures. His grants focus on clique-width and stability in graphs, reflecting his commitment to advancing theoretical and applied discrete mathematics.
Kazushi Ueda is an Associate Professor at the Graduate School of Mathematical Sciences, The University of Tokyo, where he has been since April 2015. His research spans algebraic geometry, symplectic geometry, and mathematical physics, with a focus on homological mirror symmetry and its applications to moduli spaces, Calabi-Yau manifolds, and singularities. He previously held academic positions at Osaka University from 2006 to 2015, including roles as Assistant Professor and Associate Professor. Ueda has also had visiting appointments at institutions such as the University of Oxford, Max Planck Institute for Mathematics, and Korea Institute for Advanced Study. Bachelor of Science, Kyoto University (1997-2001) Master of Science, Kyoto University (2001-2003) Doctor of Science, Kyoto University (2003-2006) Ueda's research explores the deep interplay between complex and symplectic geometry through mirror symmetry, particularly in the context of Calabi-Yau varieties, toric degenerations, and dimer models. His work addresses derived categories, stability conditions, and moduli problems, with recent contributions to noncommutative algebraic geometry and applications in mathematical physics. He has collaborated extensively with researchers like Akira Ishii, Masahiro Futaki, and Shinnosuke Okawa. His publications highlight homological mirror symmetry for K3 surfaces, Grassmannians, and singularities, as well as studies on modular forms, cluster transformations, and the Grothendieck ring. Ueda is a member of the Mathematical Society of Japan and has contributed to educational programs, including graduate lectures on mirror symmetry and symplectic geometry.
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.
Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.
Vasu Tewari is an Assistant Professor (CLTA) at the University of Toronto, working across both the Downtown Toronto (St. George) and Mississauga (UTM) campuses. Their office is located at HU1015 (215 Huron), and they can be reached at vasu.tewari@utoronto.ca. As a member of the Department of Mathematics within the Faculty of Arts and Science, Professor Tewari contributes to both teaching and research activities at the university. Professor Tewari's research focuses on advanced topics in algebraic combinatorics, with particular expertise in: Quasisymmetric functions and their geometric interpretations Schubert polynomial theory and related structures Representation theory of symmetric groups and related algebras Combinatorial aspects of algebraic geometry Enumerative combinatorics with connections to symmetric functions Algebraic structures arising from combinatorial objects Analysis of Professor Tewari's recent publications reveals a consistent focus on the interplay between combinatorial structures and algebraic frameworks. Their work often explores generalizations of classical symmetric function theory through the lens of quasisymmetric functions, providing new insights into Schubert calculus, permutation statistics, and geometric combinatorics. A notable trend in their research is the investigation of stability phenomena in combinatorial structures and the development of new algebraic tools for studying these phenomena. Professor Tewari has made significant contributions to understanding the geometry of combinatorial objects through algebraic methods, particularly in the areas of permutahedral varieties, zonotopal algebras, and quiver representations. Their work bridges pure mathematics with potential applications in theoretical physics and computer science.
Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.
Yulan Qing is an Assistant Professor in the Department of Mathematics at the University of Tennessee, Knoxville (UTK), part of the College of Arts and Sciences. She holds a Ph.D. in Mathematics from Tufts University. Her research focuses on low-dimensional topology, geometric group theory, asymptotic properties of groups, and big mapping class groups. Notable projects include studies on Gromov boundaries, genericity in groups, and curve graphs. She has published extensively in journals like Geometry & Topology and the Journal of the London Mathematical Society. Dr. Qing has organized conferences such as the 53rd Barrett Memorial Lectures and the GGTea Webinar, fostering collaboration in geometric group theory. She has taught courses like Honors Topology at UTK and supervised graduate students including Sagnik Jana and Alex Squires. Her work bridges theoretical foundations with applications in topology and geometry. Recent invited talks include presentations at the University of Virginia, Caltech, and the 2nd China-Russia Conference on Topology. She actively mentors undergraduate and graduate students, contributing to initiatives like the Math Circle programs at Tufts and MIT's RSI Summer Program.
Maria Chudnovsky is a Professor in the Department of Mathematics at Princeton University. Her research focuses on structural graph theory, particularly in areas such as graph decomposition, induced subgraphs, and algorithmic applications of graph structure. She is renowned for her contributions to understanding perfect graphs, even-hole-free graphs, and the Erdős–Hajnal conjecture. Her work often explores the interplay between graph structure and algorithmic efficiency, with applications in combinatorial optimization and theoretical computer science. Notable contributions include foundational results on tree decompositions, chromatic number bounds, and the structure of metrizable graphs. Recent research trends include investigations into induced subgraph obstructions, tree independence numbers, and the properties of sparse graphs. She has published extensively on topics such as clique-stable set separation, rainbow matchings, and the complexity of graph coloring problems in restricted graph classes. Chudnovsky has been involved in significant collaborative projects, including work funded by the DMS-EPSRC grant 'The Power of Graph Structure' (2021). Her research frequently bridges theoretical insights with practical algorithm design, contributing to both fundamental and applied areas of discrete mathematics.
Professor Alexander Scott is a faculty member at the University of Oxford, holding positions as Professor of Mathematics and Dominic Welsh Tutor in Mathematics at Merton College. His research focuses on combinatorics, probability, algorithms, and graph theory, with a particular interest in the interplay between local and global structures in networks. He has organized the Oxford Combinatorics Seminar and co-founded the online Oxford Discrete Mathematics and Probability Seminar, fostering collaboration in these fields. Professor Scott’s work bridges theoretical foundations with applications in statistical physics and algorithmic design. He has supervised numerous graduate students in combinatorics and regularly teaches undergraduate courses in analysis and discrete mathematics. His contributions include advancements in extremal graph theory, probabilistic methods, and structural combinatorics, with over 150 publications in prestigious journals. He actively organizes academic events such as the annual One-Day Meeting in Combinatorics, hosting speakers from around the world. Despite the absence of explicit awards noted, his prolific research output and academic leadership reflect significant contributions to the field. His current interests continue to explore the Erdős-Hajnal conjecture, induced subgraph densities, and algorithmic challenges in combinatorial structures.
Giorgis Petridis is an Associate Professor at the University of Georgia, specializing in arithmetic combinatorics, a field rooted in combinatorial number theory with modern extensions into discrete analysis and finite field geometry. Born in Athens, Greece, he earned his PhD from the University of Cambridge under Tim Gowers and held a Visiting Assistant Professor position at the University of Rochester. He serves as an editor for Combinatorial Theory and is affiliated with the Number Theory and Arithmetic Geometry group, particularly its additive combinatorics and discrete analysis subgroup. Doctor of Philosophy (2011), University of Cambridge Certificate of Advanced Studies in Mathematics (2002), St John’s College, Cambridge BA (Hons) in Mathematics (2001), St John’s College, Cambridge His research focuses on additive combinatorics, exploring sumset estimates, polynomial configurations in prime lattices, and geometric incidence problems over finite fields. He investigates combinatorial geometry, including pinned distance problems and bisector arrangements, while also contributing to exponential sum bounds and expander graph theory. His work bridges theoretical mathematics with applications in pseudorandomness and discrete geometry. Recent publications highlight trends in finite field analysis, with 6 of 15 articles addressing arithmetic structures in prime-order fields. Key keywords include Combinatorics , Number Theory , and Finite Fields , with sub-fields spanning polynomial configurations, energy bounds, and geometric combinatorics. Scientific awards include the Creative Research Medal (2024) from the University of Georgia for mid-career research impact. Grants from the Simons Foundation (MPS-TSM-00007816) and multiple NSF DMS Awards (2054214, 1723016, 1500984, 1804049) support his work on discrete analysis and conferences. He co-advises five PhD students and has supervised multiple Master’s theses on topics like point-plane incidences and additive energy. Outreach includes leading high school math teams, organizing discrete analysis sessions, and contributing to public science communication guides.
Béla Bollobás is a renowned mathematician affiliated with the University of Memphis as the Jabie Hardin Chair of Excellence in Combinatorics and the University of Cambridge as a Fellow of Trinity College and Honorary Professor at the Centre for Mathematical Sciences. His work spans combinatorics, probability theory, and graph theory, with significant contributions to percolation and random graphs. Dr. Rer. Nat. (Budapest, 1967) Ph.D. (Cambridge, 1972) Sc.D. (Cambridge, 1984) Bollobás pioneered extremal graph theory, random graphs, and probabilistic combinatorics. He introduced novel graph polynomials and advanced bootstrap percolation models, impacting both theoretical mathematics and statistical physics. His research includes inhomogeneous random graphs and cellular automata in random environments. His selected publications reveal a focus on percolation thresholds, graph invariants, and stochastic processes. Notably, he derived sharp thresholds for bootstrap percolation and defined critical probabilities for Voronoi percolation. Senior Whitehead Prize (2007) Fellow of the Royal Society (2011) Foreign Member, Hungarian Academy of Sciences (1990) Foreign Member, Polish Academy of Sciences (2013) Honorary Doctorate, Adam Mickiewicz University (2013) Szechenyi Prize (2017) Bollobás has supervised over 50 Ph.D. students and authored over 450 publications, including 10 books. He co-founded the journal Combinatorics, Probability and Computing and served on eight editorial boards. He organized numerous conferences, including Bill Tutte and Paul Erdős events.
