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

• Topology
• Algebraic Topology
• K-Theory
• +۵ مورد دیگر

Wolfgang Lück is a Professor of Mathematics at the University of Bonn, affiliated with the Hausdorff Center for Mathematics (HCM) and the Hausdorff Research Institute for Mathematics (HIM). He holds a Max Planck Fellowship at the Max Planck Institute for Mathematics (MPIM) and served as HCM spokesperson from 2019–2022. His research focuses on topology, particularly topological invariants, K- and L-theory, and geometric group theory. He has pioneered work on the Farrell-Jones conjecture and L²-invariants, earning prestigious awards like the Leibniz Prize (2008) and ERC Advanced Grant (2015). Education: Studied mathematics in Göttingen (BSc 1981, PhD 1984), habilitation (1989) Prior roles: Full professor at Mainz (1991–1996), Münster (1996–2010), and spokesperson for the SFB “Geometry, Groups & Actions” His research interests span manifold classification, surgery theory, and algebraic K-theory. Over 50 publications since 2013 alone demonstrate his prolific contributions. Awards include membership in the German Academy of Sciences (2010) and North Rhine-Westphalian Academy (2013). Grants: ERC Advanced Grant (2015), Max Planck Research Prize (2003) Leadership: Directed HIM (2011–2017), led collaborative research initiatives

• 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.

• Group Theory
• Algebra
• Coding Theory
• +۳ مورد دیگر

Mima Stanojkovski is an Assistant Professor at the Department of Mathematics, University of Trento. Her research focuses on group theory, algebra, and their applications in coding theory and cryptography. She teaches courses such as Algebra B, Statistics for Data Science, and Teoria dei Gruppi, emphasizing foundational concepts in abstract algebra and their practical implications. Teaching Responsibilities: Algebra B (Department of Mathematics) Statistics for Data Science (Department of Sociology and Social Research) Teoria dei Gruppi (Department of Mathematics) Research Interests: Mima's work centers on geometric and combinatorial aspects of finite groups, modular group algebras, and cryptographic applications of algebraic structures. She explores topics such as independence complexes, rank-metric codes, and pro-p group constructions. Her recent publications address conjectures in coding theory and security analyses of homomorphic encryption schemes. Grants & Collaborations: No grants or collaborative projects explicitly listed in the provided text. Labs/Teams: No specific lab affiliations or research teams mentioned.

• Algebra
• Evolution Algebras
• Rational Homotopy Theory
• +۴ مورد دیگر

MARIA CRISTINA COSTOYA RAMOS is a Professor at the University of Santiago de Compostela , affiliated with the Faculty of Mathematics and Department of Mathematics . Her primary research areas include Algebra , Evolution Algebras , and Rational Homotopy Theory , with additional interdisciplinary contributions to Medicine in pediatrics and urology. Her recent research focuses on permutation representations , automorphisms of evolution algebras , and applications of category theory and topology to algebraic structures. Publications also include clinical studies on pediatric medical interventions, reflecting collaborative work across disciplines. Key article trends span topics like homotopy nilpotent loop spaces , self-homotopy equivalences , and medical treatments for neonatal and pediatric conditions. Her work bridges abstract algebra with practical applications in both mathematics and medicine.

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.

Gergely Zábrádiمشاهده پروفایل

دانشیار

• Algebraic Number Theory
• Iwasawa Theory
• Elliptic Curves
• +۵ مورد دیگر

Gergely Zábrádi is an Associate Professor and Head of the Department of Algebra and Number Theory at the Institute of Mathematics, Eötvös Loránd University (ELTE), Budapest. He earned his PhD from Trinity College, University of Cambridge, and conducted postdoctoral research at Westfälische Wilhelmsuniversität Münster. His academic focus lies at the intersection of algebraic number theory, Iwasawa theory, and the p-adic Langlands programme. Education: PhD in Mathematics, Trinity College, University of Cambridge (2008) Habilitation, Eötvös Loránd University (2016) Research Interests: Zábrádi's research spans algebraic number theory , particularly noncommutative Iwasawa theory for elliptic curves, and the p-adic Langlands programme . He explores deep connections between Galois representations , automorphic forms , and L-functions , utilizing tools like (φ,Γ)-modules and perfectoid spaces . Publications Overview: His recent work includes studies on generalized Montréal functors , matrix Kloosterman sums , and sup-norm problems for automorphic forms. These publications reflect a consistent engagement with foundational questions in arithmetic geometry and representation theory. Advising and Grants: Zábrádi has supervised numerous PhD, Master's, and Bachelor's theses, guiding students through topics ranging from Iwasawa theory to p-adic Galois representations . His mentorship has produced award-winning research, including first-prize recognition at the Hungarian Student Research Competition (OTDK). Research Groups and Labs: He leads a vibrant research group at ELTE, fostering collaboration with international scholars and participating in networks like the CENTRAL programme. His team focuses on advancing the p-adic Langlands correspondence and related arithmetic questions.

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.

• Symplectic Geometry
• Poisson Geometry
• Contact Geometry
• +۷ مورد دیگر

Eva Miranda is a Full Professor of Mathematics at the Universitat Politècnica de Catalunya (UPC), Barcelona, and a Researcher at the Centre de Recerca Matemàtica (CRM). She leads the Geometry, Topology, Algebra, and Applications Group (GEOMVAP) and directs the Laboratory of Geometry and Dynamical Systems. Her research focuses on symplectic and Poisson geometry, with applications to dynamical systems, fluid dynamics, and mathematical physics. Key areas include singular symplectic manifolds, integrable systems, and the interplay between geometry and computation. Affiliations: Full Professor at UPC (Department of Mathematics) ICREA Academia Researcher Chercheur Affilié at Observatoire de Paris Member of BGSMath and European Mathematical Society Her research explores connections between geometry and computational complexity, notably demonstrating Turing universality in 3D Euler flows (a breakthrough resolving a decades-old problem). She also investigates singularities in Hamiltonian systems, symplectic reduction, and Poisson geometry. Her work bridges disciplines like celestial mechanics, fluid dynamics, and computer science. Notable achievements include the ICREA Academia Prize (2021), Bessel Research Prize (2022), and Hardy Lectureship (2023). She supervises a vibrant team of PhD students and postdocs, fostering interdisciplinary collaborations through networks like SYMCREA and COMPLEXFLUIDS. Her recent projects include exploring topological Kleene field theories, entropy in Turing-complete systems, and desingularization of Poisson manifolds. She actively promotes women in mathematics and contributes to scientific outreach through lectures and media articles.

• Model Theory
• Geometric Group Theory
• Algorithmic Group Theory
• +۳ مورد دیگر

Dr. Mahmood Sohrabi serves as a Teaching Associate Professor and Associate Chair for Graduate Studies in the Department of Mathematical Sciences at Stevens Institute of Technology's Charles V. Schaefer, Jr. School of Engineering and Science. His academic appointments include Teaching Associate Professor (2016–Present), Affiliate Associate Professor (2014–2016), and Affiliate Assistant Professor (2013–2014), following prior roles as a College Professor at Dawson College (2011–2013) and postdoctoral fellowships at McGill University and Université de Montréal. His research focuses on Model Theory, Geometric and Algorithmic Group Theory, specializing in the model theory of nilpotent groups, linear groups, and rings. Key research areas include elementary equivalence of algebraic structures, ω-stability, Morley rank, bi-interpretability with integers, and algorithmic properties of matrix groups. His work bridges theoretical mathematics with computational applications in group classification and logical definability. Dr. Sohrabi actively contributes to institutional governance through the Graduate Curriculum Committee, Graduate Studies Committee, Hiring Committee, and multiple curriculum revision task forces. He serves as a peer reviewer for the Pacific Journal of Mathematics, Journal of Groups, Complexity, Cryptology, Journal of Pure and Applied Algebra, and CS conferences including LATA. His research output demonstrates sustained contributions to understanding the logical foundations of algebraic structures, with recent emphasis on classical matrix groups and their theoretical properties.

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.

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.

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.

James E. Hansonمشاهده پروفایل

استادیار

• Mathematical Logic
• Model Theory
• Continuous Logic
• +۲ مورد دیگر

James E. Hanson is an Assistant Professor of Mathematics at Iowa State University, specializing in mathematical logic with a particular focus on model theory and its interactions with real analysis. His research bridges pure mathematics and theoretical physics, reflecting his earlier background in high energy theoretical physics. Ph.D. in Mathematics, University of Wisconsin–Madison (December 2020) M.A. in Physics, University of Wisconsin–Madison (December 2016) B.Sc. in Mathematics and Physics, University of Minnesota, Twin Cities (May 2012) Hanson's research interests center on continuous logic, model theory, and their applications. His work explores the connections between logical structures and metric spaces, with significant contributions to stability theory, categoricity in continuous logic, and the study of definable sets in metric structures. He has made important advances in understanding forking independence, Morley sequences, and Keisler measures within the framework of continuous logic. Hanson's publication record shows a clear trajectory from theoretical physics to mathematical logic. His recent work (2023-2025) is almost exclusively focused on continuous logic and model theory, with particular attention to categoricity, strongly minimal sets, and independence relations. His publications demonstrate a sophisticated integration of topological, metric, and logical perspectives, establishing him as a significant contributor to the development of continuous model theory. Hanson is actively involved in the logic community, having presented his research at numerous prestigious venues including the Logic Colloquium, Association for Symbolic Logic meetings, and various university logic seminars. Notably, he hosts a mirror of the former Model Theory wiki, preserving valuable reference material for the community after the original wiki was deleted in 2023. In addition to his research, Hanson has contributed to educational efforts in logic, giving introductory talks on continuous logic and participating in graduate student conferences. His early work in theoretical physics demonstrates the interdisciplinary nature of his mathematical thinking, which continues to inform his approach to model-theoretic problems.