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

• Representation Theory
• Finite Dimensional Algebras
• Algebraic Combinatorics
• +۳ مورد دیگر

Kay Jin Lim serves as Senior Lecturer and Director of the MSc (Analytics) program at Nanyang Technological University's School of Physical & Mathematical Sciences, where he contributes significantly to both academic leadership and mathematical research within the Division of Mathematical Sciences. His educational foundation includes a B.Sc. (2005), M.Sc. (2007), and Ph.D. (2009) from the National University of Singapore, followed by doctoral research at the University of Aberdeen under David John Benson's supervision. Lim's research centers on representation theory of finite dimensional algebras, with deep connections to algebraic combinatorics and algebraic geometry. His work explores modular representation theory of symmetric groups, Specht modules, and Lie modules, emphasizing combinatorial structures and geometric interpretations in positive characteristic settings. This specialized focus has established him as a contributor to advanced algebraic frameworks. Analysis of his publication trajectory (2013-2025) reveals consistent advancement in understanding module complexities, rank varieties, and symmetric group representations, with increasing emphasis on interdisciplinary connections between algebraic combinatorics and geometric methods. His collaborative approach with international researchers like Karin Erdmann and David Benson demonstrates engagement with cutting-edge developments in the field. Scientific awards: No awards, fellowships, or major prizes are documented in the available information. Lim maintains an active supervisory role with four doctoral students: Yu Jiang (graduated May 5, 2021), Jialin Wang (graduated March 31, 2024), and current candidates Kua Hao Yan Manzu and Chen Siyuan. His teaching portfolio spans foundational to advanced algebra courses including MH2220 Algebra I, MH3220 Algebra II, and specialized topics in Homological Algebra, reflecting his commitment to mathematical education at multiple levels. He operates within NTU's vibrant mathematical research ecosystem, maintaining significant collaborations with leading algebraists globally while directing the MSc (Analytics) program to integrate theoretical mathematics with practical analytical applications.

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Daniel A. Spielmanمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +۷ مورد دیگر

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

Laura Andersonمشاهده پروفایل

دانشیار

• Combinatorics
• Topology
• Matroid Theory
• +۳ مورد دیگر

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مشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Algebraic 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.

• Set Theory
• Mathematical Logic
• Forcing
• +۷ مورد دیگر

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.

John MacLaren Walshمشاهده پروفایل

استاد

• Information Theory
• Network Coding
• Distributed Computing
• +۴ مورد دیگر

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.

Gil Kalaiمشاهده پروفایل

استاد

• Combinatorics
• Geometric Combinatorics
• Probabilistic Combinatorics
• +۷ مورد دیگر

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.

Ieke Moerdijkمشاهده پروفایل

استاد

• Algebraic Topology
• Differential Topology
• Mathematical Logic
• +۳ مورد دیگر

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مشاهده پروفایل

دانشیار

• Analysis
• Partial Differential Equations
• Probability
• +۵ مورد دیگر

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.

Stephen A. Vavasisمشاهده پروفایل

استاد

• Continuous Optimization
• Data Science
• First-Order Methods
• +۴ مورد دیگر

Stephen A. Vavasis is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, part of the Faculty of Mathematics. He holds a PhD in Computer Science from Stanford University (1989) and has held academic positions at Cornell University (1989–2006) before joining Waterloo. His research focuses on continuous optimization, data science, first-order methods, scientific computing, and computational mechanics. Current teaching includes courses on convex optimization and portfolio optimization methods. He has served as Associate Dean of Computing (2017–2020) and Interim Director of Data Science graduate programs. His work is supported by NSERC grants. Notable awards include the Hertz Fellowship, Churchill Scholarship, and Guggenheim Fellowship. Vavasis's research emphasizes applications of optimization to clustering, machine learning, and fracture mechanics. His publications span convex optimization frameworks, algorithmic analysis of gradient methods, and numerical methods in mechanics. Recent work explores unifying analyses of first-order optimization algorithms and robust optimization techniques for high-dimensional data problems.

Vadim Lozinمشاهده پروفایل

استاد

• Graph theory
• Combinatorics
• Discrete Mathematics
• +۴ مورد دیگر

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.

Tobias Dyckerhoffمشاهده پروفایل

استاد

• Higher Structures in Algebra and Geometry
• Algebraic Topology
• Homological Algebra
• +۳ مورد دیگر

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.

Franziska Jahnkeمشاهده پروفایل

استاد

• Model Theory
• Set Theory
• Algebra
• +۳ مورد دیگر

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مشاهده پروفایل

دانشیار

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +۳ مورد دیگر

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.