جست‌وجوی استاد و پژوهشگر

Roland Bauerschmidtمشاهده پروفایل

استاد

• Probability Theory
• Mathematical Physics
• Statistical Mechanics
• +۵ مورد دیگر

Roland Bauerschmidt is a Professor of Mathematics at the Courant Institute of Mathematical Sciences, New York University. He previously held a professorship at the University of Cambridge and conducted postdoctoral research at Harvard and the Institute for Advanced Study. His research focuses on probability theory, mathematical physics, and statistical mechanics, particularly in spin systems, renormalization group methods, stochastic dynamics, and random matrices. He has contributed extensively to understanding phase transitions, critical phenomena, and universality classes. Education: PhD from the University of British Columbia (advised by David Brydges and others), undergraduate degrees from ETH Zurich. Research interests include applications of supersymmetry in probability, Coulomb systems, and log-Sobolev inequalities. He has organized programs such as the HIM Trimester Program on Probabilistic Methods in Quantum Field Theory. His teaching spans graduate and undergraduate courses in probability theory, stochastic dynamics, and mathematical analysis at NYU, Cambridge, and international institutions. His work frequently intersects with renormalization group techniques, spectral gaps, and non-equilibrium dynamics. Recent publications explore log-Sobolev inequalities in spin systems, high-temperature discrete Gaussian models, and percolation transitions in random forests.

Joy Morrisمشاهده پروفایل

استاد

• Combinatorics
• Algebraic Graph Theory
• Group Theory
• +۴ مورد دیگر

Joy Morris is a Professor at the Department of Mathematics & Computer Science at the University of Lethbridge. She earned her BSc from Trent University in 1992 and her PhD from Simon Fraser University in 2000 under Brian Alspach. Her academic journey includes tenure in 2005, promotion to Associate Professor, and full Professor status in 2015. Research Focus: Interactions between group theory and graph theory, with emphasis on Cayley graphs and automorphisms Key Contributions: Solving the distinguishing number problem for various graph families, advancing DCI/CI group theory Research Overview Her work bridges abstract algebra with graph theory through Cayley graphs. She investigates automorphism groups, Hamilton cycles, and graph symmetry properties. Notable contributions include resolving the DCI property for specific groups, analyzing Praeger-Xu graphs, and studying color-preserving automorphisms. Academic Leadership As a co-author of two influential open-access textbooks ( Proofs and Concepts with Dave Morris and her own Combinatorics text), she has shaped curriculum development and mathematical education outreach programs for parents in Alberta. Her teaching portfolio includes foundational courses like Math 2000 and advanced combinatorial theory instruction. Collaborative Impact With over 30 publications since 1996, her collaborations span international researchers including C. Praeger, P. Spiga, and E. Dobson. Current projects involve hypercube distinguishing costs and automorphism group analysis of vertex-transitive digraphs. She maintains active research into graphical regular representations and graph isomorphism problems.

• Polyhedral combinatorics
• Extended formulations
• Combinatorial optimization
• +۲ مورد دیگر

Samuel Fiorini is Associate Professor in the Department of Mathematics at the Université libre de Bruxelles (ULB) , member of the Algebra and Combinatorics group (CP 216). His research centres on polyhedral combinatorics, extended formulations, combinatorial optimisation and approximation algorithms , with frequent overlap into structural graph theory. Research in depth: Fiorini’s work explores how high-dimensional polytopes can sometimes be expressed compactly through extended formulations, proving exponential lower bounds when they cannot. He has contributed new approximation algorithms for classical problems such as vertex cover, clique transversal and odd-cycle packing, and has advanced the understanding of sorting and entropy in partially ordered sets. His papers often combine tools from graph minors, communication complexity and polyhedral theory. Scientific recognition: Best Paper Award, 44th ACM Symposium on Theory of Computing (STOC 2012) Programme committees: FOCS, IPCO, APPROX, STACS, WAOA Organiser, Sixth Cargese Workshop on Combinatorial Optimization Advising & grants: He currently supervises PhD students Carole Muller and Matthew Drescher and has mentored six completed PhDs as well as more than a dozen post-doctoral researchers. His group has been supported by an ERC starting grant and other national and international projects focusing on polyhedral approaches to hard optimisation problems. Lab & team: Fiorini leads a vibrant team within the Algebra and Combinatorics cluster at ULB, maintaining active collaborations with researchers worldwide and hosting frequent visitors working on discrete optimisation and polyhedral combinatorics.

Marc Hellmuthمشاهده پروفایل

دانشیار

• Discrete Mathematics
• Combinatorics
• Graph Theory
• +۱۰ مورد دیگر

Marc Hellmuth is an Associate Professor of Computational Mathematics at the Department of Mathematics, Stockholm University, Sweden. His academic career includes previous positions as Junior Professor for Biomathematics and Computer Science at University of Greifswald, Germany (2015-2020), Lecturer at School of Computing, University of Leeds, UK (2020), and PostDoc positions at Saarland University and Max-Planck Institutes. Dr. Hellmuth earned his PhD in Computer Science from University of Leipzig, Germany (2007-2010, summa cum laude), supervised by Peter F. Stadler, and completed his Venia Legendi (habilitation) at Saarland University, Germany (2016). His research spans the interface of discrete mathematics, computer science, and life sciences with emphasis on: Discrete Mathematics including Graph Theory, Combinatorics, and Optimization Algorithm Design and Complexity Theory Mathematical and Computational Biology Phylogenomics and Evolutionary Analysis Computational Chemistry and Atom Tracking His publication record demonstrates a consistent focus on developing mathematical frameworks and efficient algorithms for biological problems, particularly in phylogenomics, orthology detection, and evolutionary analysis. His work bridges theoretical computer science with practical applications in biology and chemistry, often resulting in open-source software tools. Dr. Hellmuth has developed numerous software tools including AsymmeTree for phylogenetic simulation, tralda for tree algorithms, and specialized tools for phylogenomics, atom tracking, and graph analysis. His collaborative work extends internationally with research visits to institutions including Yale University, University of Leoben, Vienna University of Economics, University of Southern Denmark, Université de Montréal, and institutions in China.

Torsten Ueckerdtمشاهده پروفایل

استاد

• Graph Theory
• Geometric Graph Theory
• Discrete Mathematics
• +۸ مورد دیگر

Torsten Ueckerdt is an Interim Professor in the Algorithmics I group at the Institute of Theoretical Informatics, Karlsruher Institut für Technologie (KIT). He has held academic positions since 2012, including postdoctoral roles and habilitation in Discrete Mathematics. His research focuses on combinatorial objects like graphs, posets, and hypergraphs in geometric settings, exploring structural properties, colorings, and geometric representations. Holds a PhD from TU Berlin (2011) and habilitation from KIT (2017). Professional service includes editorial roles (Annals of Combinatorics) and program committees for conferences like Graph Drawing, SoCG, and EuroCG. Supervised numerous students across Bachelor's, Master's, and diploma theses. Research interests span structural graph theory, geometric graph theory, Ramsey theory, discrete geometry, and combinatorial games. Active in graph drawing and algorithm design, with contributions to queue layouts, graph representations, and optimization problems like cartograms and wind farm cabling.

Jagdeep Singhمشاهده پروفایل

استادیار

• Matroid Theory
• Graph Theory

Jagdeep Singh is an Assistant Professor of Mathematics at Mississippi State University specializing in combinatorial mathematics with focus on matroid theory and graph theory. His research examines structural properties of matroids and their connections to graph theory. Education: PhD Mathematics, Louisiana State University (2022) BS-MS Dual Degree, IISER Mohali Dr. Singh investigates fundamental combinatorial structures through matroid operations and graph modifications. His work develops theoretical frameworks for matroid classes and graph families with specific closure properties, extending concepts like cographs to higher-dimensional matroidal structures. He teaches courses in Graph Theory, Group Theory, and Foundations of Geometry. Dr. Singh has received multiple teaching awards including the LSU Alumni Association Teaching Assistant Award and has been recognized for teaching excellence throughout his career.

Simon Thomasمشاهده پروفایل

استاد

• Set Theory
• Model Theory
• Infinite Group Theory

Simon Thomas is a Distinguished Professor of Mathematics at Rutgers, The State University of New Jersey, specializing in set theory, model theory, and infinite group theory. He is actively involved in teaching and research, with a focus on classification problems in group theory and descriptive set theory. Research Interests Thomas's research spans a broad range of topics within mathematical logic and group theory. His primary interests include: Set Theory: Focus on foundational aspects and applications to group theory. Model Theory: Investigations into the structure of models and their implications for group classification. Infinite Group Theory: Study of infinite groups, particularly in the context of descriptive set theory and ergodic theory. His work often involves the interplay between logic and group theory, leading to significant contributions to understanding the complexity of classification problems for various classes of groups. Scientific Contributions Thomas has authored numerous papers on the classification of groups using tools from descriptive set theory and ergodic theory. His research includes studies on torsion-free abelian groups, finitely generated groups, and Borel equivalence relations. Notable contributions include work on the automorphism tower problem, superrigidity phenomena, and the complexity of isomorphism relations for various algebraic structures. Teaching and Mentorship Thomas teaches courses in set theory and logic at Rutgers, including Math 361: Set Theory. He also organizes the Rutgers Logic Seminar, a weekly meeting that brings together researchers in logic and related fields from around the world. The seminar covers topics in set theory, model theory, and applications to algebra and computer science.

Thomas Gärtnerمشاهده پروفایل

استاد

• Machine Learning
• Graph Neural Networks
• Geometric Deep Learning
• +۳ مورد دیگر

Thomas Gärtner is a Professor at the Institute of Logic and Computation within the Faculty of Informatics at Vienna University of Technology, leading the Machine Learning research group (E194-06). His work bridges theoretical machine learning with practical applications in chemistry, biology, and network analysis. His primary research focuses on graph neural networks (GNNs) and geometric deep learning, with significant contributions to GNN expressivity, graph transformations, and kernel methods for structured data. He explores fundamental questions about the limitations of message-passing architectures while developing practical enhancements like path-based extensions and expectation-complete representations. His chemical informatics work applies these techniques to binding affinity prediction, reaction classification, and solvent selection, demonstrating real-world impact in computational chemistry. Analysis of his 15 most recent publications (2023-2025) reveals three dominant research thrusts: theoretical GNN advancements (35% of articles), chemical informatics applications (40%), and novel learning frameworks (25%). The theoretical work increasingly addresses expressivity limitations through graph transformations and path-based approaches, while chemical applications show growing sophistication in molecular representation. Recent publications also indicate expanding interest in foundation models for graphs and robustness verification. He actively supervises master's students including Fabian Traxler (binding affinity prediction), Maximilian Plattner (SGD optimization), Fabian Jogl (graph transformations), and Thomas Schmied (reinforcement learning). His research is conducted through the Network Lab at TU Wien, where he serves as Principal Investigator for the Structured Data Learning with Generalized Similarities project.

• Lie Algebras
• Combinatorial Mathematics
• Nonassociative Rings and Algebras
• +۳ مورد دیگر

Manuel Ceballos González is a Researcher at the Universidad de Sevilla within the Department of Economics, Quantitative Methods, and Economic History. His academic work spans mathematics, computer science, and combinatorics, focusing on Lie algebras , Leibniz algebras , and evolution algebras . Education: PhD in Mathematics from Universidad de Sevilla (2012), with a thesis on abelian subalgebras and ideals in Lie algebras. His research explores the intersection of algebraic structures and combinatorial methods , particularly through matrix representations and graph-theoretic approaches. Key contributions include algorithms for computing abelian subalgebras, classifications of filiform Lie algebras, and studies on evolution algebras linked to (pseudo)digraphs. The 15 most recent publications highlight his work on solvable Leibniz algebras, Zinbiel algebras, and combinatorial structures in upper-triangular matrices. These articles reflect a blend of nonassociative ring theory , graph theory , and computational algebra , with applications in mathematical modeling and symbolic computation. Collaborations with prominent mathematicians like Juan Núñez-Valdés and Ángel F. Tenorio underscore his integration into the academic community. While no specific awards are listed, his extensive co-authorship network (35 joint publications) and contributions to zbMATH-indexed journals indicate significant scholarly impact.

Federico Vigoloمشاهده پروفایل

استادیار

• Coarse Geometry
• Operator Algebras
• Group Theory
• +۷ مورد دیگر

Federico Vigolo is a Junior Professor in pure mathematics at the University of Göttingen's Mathematical Institute and a Principal Investigator of RTG 2491 - Fourier Analysis and Spectral Theory. He also serves as one of the Equal Opportunities Officers (Gleichstellungsbeauftragte) of the Mathematical Institute. His work bridges several areas of mathematics including coarse geometry, operator algebras, and geometric group theory. Dr. Vigolo completed his PhD at the University of Oxford in 2018 with a thesis titled "Geometry of actions, expanders and warped cones". His academic journey has led him to become a prominent researcher in coarse geometry and its interactions with other mathematical fields. His primary research focuses on Coarse Geometry and its rich interactions with operator algebras, index theory, and group theory. Specific topics he has extensively worked on include Roe algebras, Expander Graphs, coarse Baum–Connes conjecture, actions on metric and measure spaces, and CAT(0) and Hyperbolic Cube Complexes. His work often explores the connections between large-scale geometric properties and algebraic structures, with significant contributions to understanding coarse groups and warped cones. An analysis of his publication record reveals a strong focus on the intersection of coarse geometry with operator algebras and group theory. His work consistently explores how coarse geometric properties manifest in algebraic structures like Roe algebras, and how these connections can be used to prove rigidity results or construct counterexamples to important conjectures. A notable trend is his development of frameworks that unify previously disparate concepts in coarse geometry, such as his work on coarse geometric modules and rigidity frameworks for Roe-like algebras. His 2023 monograph "An Invitation to Coarse Groups" represents a foundational contribution to this emerging field. Professional Activities Organizer of the "Autumn School on Large Scale Geometry" (2023, Göttingen) Organizer of the "Random walks and related random topics" workshop (2022, Göttingen) Organizer of the YMC*A conference (2021, Münster) Organizer of the "Interactions between expanders, groups and operator algebras" mini-workshop (2021, Münster) Dr. Vigolo actively supervises students, with Christos Kitsios currently pursuing a PhD under his guidance. He welcomes bachelor's and master's students interested in topics related to coarse geometry, geometric group theory, group actions on measure spaces, and operator algebras. He teaches a variety of courses including "Analytische Geometrie und Lineare Algebra," "Introduction to algebraic topology," and specialized seminars on topics like "Gender and Mathematics" and "topological K-theory." His research has led to significant contributions in multiple areas, particularly in developing the theory of coarse groups and exploring the connections between coarse geometry and C*-algebras. His work on warped cones and asymptotic expanders has provided new counterexamples to the coarse Baum-Connes conjecture and advanced our understanding of coarse geometric invariants.

Oleg Pikhurkoمشاهده پروفایل

استاد

• Extremal combinatorics
• Graph theory
• Descriptive combinatorics
• +۶ مورد دیگر

Oleg Pikhurko is a Professor of Mathematics at the University of Warwick, affiliated with both the Mathematics Institute and DIMAP (the Centre for Discrete Mathematics and its Applications). His office is located in room B2.12 at the University of Warwick in Coventry, UK. Pikhurko has established himself as a prominent researcher in combinatorics with significant contributions to extremal combinatorics, graph theory, and related fields. His research interests span a wide range of topics in discrete mathematics including extremal combinatorics and graph theory, descriptive combinatorics, graph limits, random structures, and algebraic, analytic and probabilistic methods in discrete mathematics. Pikhurko's work bridges theoretical foundations with practical applications, often employing sophisticated mathematical techniques to solve challenging problems in combinatorial structures. The analysis of Pikhurko's recent publications reveals a consistent focus on extremal combinatorics, particularly Turan-type problems, hypergraph theory, and graph limits. His work demonstrates increasing sophistication in handling complex combinatorial structures, with recent papers exploring connections to measure theory, geometry, and coding theory. Notably, his research shows a progression from classical combinatorial problems toward more abstract and interdisciplinary approaches, including measurable versions of combinatorial theorems and applications to high-dimensional spaces. ERC Advanced Grant 'Finite and Descriptive Combinatorics' (2022-2026) Pikhurko has successfully supervised numerous PhD students including Teresa Sousa (2006), David Offner (2009), Zelealem Yilma (2011), Matthew Fitch (2019), and Matteo Mazzamurro (2023). He currently co-advises Irene Gil Fernández and Zhuo Wu, both expected to complete their PhDs in 2025. His research group focuses on 'Finite and Descriptive Combinatorics,' reflecting his dual interest in finite combinatorial structures and their descriptive (measurable) counterparts. The ERC Advanced Grant awarded in 2022 has provided significant funding to support this research program through 2026. Beyond traditional research, Pikhurko founded the Hedgehog Fund, which encourages innovative proofs of mathematical results presented in his lectures. He also maintains an Erdos Lap Number of 2, having sat on the lap of Barbie Freidin (Erdos Lap Number 1) who herself sat on Paul Erdos's lap.

Terry Sooمشاهده پروفایل

دانشیار

• Probability Theory
• Ergodic Theory
• Statistical Science

Terry Soo is an Associate Professor in the Department of Statistical Science at University College London (UCL), a position he has held since 2020. His academic background includes postdoctoral roles at the University of Warwick and the University of Victoria, followed by an Associate Professorship at the University of Kansas. He holds degrees from Simon Fraser University (undergraduate) and the University of British Columbia (PhD). His research focuses on probability theory and ergodic theory , with a particular emphasis on topics such as nonsingular systems, Bernoulli shifts, and stochastic processes. His work often explores structural properties of dynamical systems and their isomorphisms, with applications to measure-preserving transformations and entropy theory. Soo teaches advanced courses such as Stat 0009 (Probability and Statistics) and LTCC Stochastic Processes . His research has been published in prestigious journals like Annals of Probability and Ergodic Theory and Dynamical Systems , and he maintains an active presence in the academic community through external profiles on arXiv, ZbMATH, and AMS.

Kevin Igaمشاهده پروفایل

استاد

• Mathematical Physics
• Supersymmetry
• Differential Topology
• +۴ مورد دیگر

Kevin Iga is a Professor of Mathematics at Pepperdine University's Seaver College, part of the Natural Science Division. He has been teaching since 1998 and holds a PhD from Stanford University (1998) and dual BS degrees in Mathematics and Physics from MIT (1992). His research focuses on supersymmetry, particularly using Adinkra diagrams, differential topology, general relativity, and cryptography. He has contributed to geometric interpretations of supersymmetry algebras and combinatorial analysis of Adinkras. Iga serves as Public Information Officer for the MAA's Philosophy of Mathematics SIG and is active in professional organizations like the AMS, ASA, and MAA. His work spans over 25 years, with significant contributions to mathematical physics, including structural theory of Adinkras, cohomological applications, and cryptographic hardness problems. He teaches courses such as Algebraic Structures, Automata Theory, and Real Analysis. Iga is also involved in community activities, singing in the Pepperdine Concert Choir and participating in Malibu Presbyterian Church.

Benjamin Rossmanمشاهده پروفایل

دانشیار

• Computational Complexity
• Finite Model Theory
• Circuit Complexity
• +۳ مورد دیگر

Benjamin Rossman is an Associate Professor in the Computer Science and Mathematics Departments at Duke University , affiliated with the Theory Group. His research focuses on computational complexity, particularly circuit complexity and finite model theory, with notable contributions to lower bounds for subgraph isomorphism problems and logical definability. Rossman earned his Ph.D. from MIT under Madhu Sudan's supervision. He has held faculty positions at the University of Toronto and postdoctoral roles at the Tokyo Institute of Technology and National Institute of Informatics in Japan. He has received prestigious awards including the Alfred P. Sloan Fellowship and NSERC grants. His teaching includes courses on computational complexity, mathematical logic, and discrete mathematics. Recent publications explore homomorphism preservation theorems, formula complexity, and treedepth in subgraph isomorphism. Rossman advises graduate students in theoretical computer science and has led research on circuit lower bounds, algorithmic logic, and combinatorial complexity. His work bridges foundational theory with practical algorithmic challenges, contributing to the understanding of computational limits in combinatorial problems.

Samir Dattaمشاهده پروفایل

استاد

• Theoretical Computer Science
• Computational Complexity Theory
• Bounded Space Complexity
• +۹ مورد دیگر

Samir Datta is a Professor at the Chennai Mathematical Institute, where he conducts research in Theoretical Computer Science with a focus on Computational Complexity Theory. His work spans foundational graph problems, circuit complexity, and interdisciplinary applications in logic and numerical analysis. His research interests include: Bounded space complexity in restricted graph classes (planar graphs, bounded tree-width, H-minor free graphs) Reachability, graph isomorphism, matching, and Steiner Tree problems Characterizations and properties of arithmetic circuits Complexity aspects of game theory, proof theory, and numerical analysis His publications reflect a deep engagement with structural complexity and algorithmic graph theory. While specific titles are referenced, a detailed list is not provided in the source text. He has advised both current and past students, though their names are not listed. No scientific awards are mentioned in the available information. He is actively involved in research and academic mentoring at CMI, with no indication of part-time status, retirement, or former affiliation.