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

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +۵ مورد دیگر

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

• Algebraic Geometry
• Number Theory
• Representation Theory
• +۳ مورد دیگر

Andreas Bode is a Research Fellow at the University of Wuppertal, where he is part of the group led by Sascha Orlik in the Department of Mathematics. His research focuses on D-modules on rigid analytic spaces, integrating geometric representation theory and nonarchimedean geometry. His research interests span several areas of algebraic geometry and number theory, including the study of p-adic differential operators, nonarchimedean geometry, and representation theory. He explores the interplay between D-modules and rigid analytic spaces, contributing to the understanding of holonomicity, Auslander regularity, and the application of almost mathematics in p-adic contexts. His work bridges geometric and analytic approaches to problems in nonarchimedean settings. Bode's recent publications include advancements in the theory of Auslander regularity for p-adic structures, contributions to the holonomicity of D-cap-modules on rigid analytic spaces, and explorations into locally analytic representations of p-adic groups. His work often intersects with homological algebra and functional analysis, reflecting a deep engagement with both theoretical and methodological challenges in nonarchimedean geometry. He has not been mentioned as having received any scientific awards in the provided texts. Bode's current role as a postdoctoral researcher does not involve formal academic advising of students. No grants are specifically mentioned in the provided information. He is affiliated with the Algebra and Number Theory group at the University of Wuppertal, collaborating with colleagues such as Sascha Orlik and contributing to the broader research community in nonarchimedean geometry.

• General Relativity
• Theoretical Physics
• Black Hole Mechanics
• +۶ مورد دیگر

Harvey Reall is a Professor of Theoretical Physics at the University of Cambridge , affiliated with the Department of Applied Mathematics and Theoretical Physics (DAMTP) and a Fellow of Trinity College . His research focuses on General Relativity and Effective Field Theory , particularly in the context of black hole mechanics , higher-dimensional gravity , and cosmic censorship . He has held prestigious positions including a Royal Society University Research Fellowship from 2005 to 2013. Education: PhD from DAMTP, University of Cambridge. Previous Appointments: Lecturer at the University of Nottingham (2005-2007); Postdoctoral positions at the Kavli Institute (2003-2005), Queen Mary University of London (2000-2003), and University of California, Santa Barbara (2003-2005). Reall's work explores the uniqueness and stability of black holes , causality in gravitational theories , and effective field theory approaches to gravity . His recent publications address nonperturbative second law formulations , event horizon dynamics , and axisymmetry theorems in extended theories of gravity. He has supervised numerous researchers including Aidan McSharry (2025-) , Maxime Gadioux (2022-) , and Iain Davies (2020-24) , contributing to the training of the next generation of physicists. Scientific Awards: Royal Society University Research Fellow (2005-2013)

• Quantum Information Theory
• Quantum Many-Body Systems
• Quantum Dissipative Evolutions
• +۲ مورد دیگر

Angela Capel Cuevas is an Assistant Professor of Quantum Information Theory/Theoretical Quantum Computation at the University of Cambridge's Department of Applied Mathematics and Theoretical Physics (DAMTP). Previously, she held a Junior Professorship at Eberhard Karls Universität Tübingen (2021-2024) and was an MCQST Distinguished PostDoc at TU München (2020-2021). Her research focuses on the intersection of quantum information theory and quantum many-body systems, particularly studying thermalization dynamics via quantum functional inequalities. She is a recipient of the Simons Emmy Noether Fellowship and Forbes 30 Under 30 (Spain 2023). Education: PhD in Mathematics, Universidad Autónoma de Madrid/ICMAT (2015-2019) Master in Computational Engineering and Mathematics, URV/UOC (2016-2018) Bachelor in Mathematics, Universidad de Granada (2009-2014) Research: Angela's work applies analytic and geometric tools to quantum systems, emphasizing decay of correlations in Gibbs states and quantum dissipative evolutions. Key topics include entropy inequalities, modified logarithmic Sobolev inequalities, and thermalization rates in spin chains. Her recent work bridges quantum functional analysis with practical implications for quantum computing and thermalization phenomena. Grants & Roles: PI of CRC TRR 352 'Mathematics of Many-Body Quantum Systems' (7M€) Co-PI of QuantERA project TouQan (1.25M€) Organized workshops at BIRS and Tübingen (2023-2024) Awards: Simons Emmy Noether Fellowship (2023) Forbes 30 Under 30 (2023) Vicent Caselles RSME-FBBVA Award (2022) Labs/Teams: Leads a group studying quantum dissipative systems and thermalization at DAMTP. Collaborates with institutions globally on quantum functional inequalities and Gibbs state properties.

Anoosheh Heidarzadehمشاهده پروفایل

استادیار

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +۳ مورد دیگر

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.

Michael O'Boyleمشاهده پروفایل

استاد

• Heterogeneous Code discovery and Optimisation
• Neural Machine Translation and Neural Synthesis
• Deep Neural Network system stack
• +۷ مورد دیگر

Michael O'Boyle is a Professor at the University of Edinburgh's School of Informatics, where he serves as Director of the ARM Research Centre of Excellence and the EPSRC Centre for Doctoral Training in Pervasive Parallelism. Holding an EPSRC Established Career Research Fellowship, he leads pioneering work in compiler technology for heterogeneous architectures, bridging theoretical advances with practical high-performance computing applications. Professor O'Boyle's research spans multiple cutting-edge areas including heterogeneous code discovery and optimization, neural machine translation for program synthesis, deep neural network system stack optimization, software-defined hardware, and compiler/architecture co-design. His approach integrates constraint analysis, program synthesis, and machine learning to address complex challenges in high-performance computing across diverse hardware platforms. His recent publications reveal a strong trend toward integrating machine learning with traditional compiler techniques, particularly in neural program synthesis, tensor optimization, and architecture-aware compilation. This work represents a paradigm shift in compiler design, moving from rule-based systems to learning-based approaches that can automatically adapt to diverse hardware targets. IEEE/ACM CGO 2025 Distinguished Paper Award for 'Tensorize: Fast Synthesis of Tensor Programs from Legacy Code' IEEE/ACM CGO 2024 Test of Time Award ACM GPCE 2023 Best Paper Award for 'C2TACO: Lifting Tensor Code to TACOM' ACM ASPLOS 2021 Distinguished Paper Award IEEE HPCA 2021 Best Paper Award for 'Prodigy: Improving the Memory Latency of Data-Indirect Irregular Workloads' Professor O'Boyle has successfully mentored numerous PhD students who have secured prominent positions in academia (including at Cambridge, Edinburgh, Leeds, and McGill) and industry (including Meta, NVIDIA, Qualcomm, Huawei, and Microsoft). His research is supported by significant funding from EPSRC, ARM, and European projects including Bonseyes and Transmuter, demonstrating strong international recognition and industry impact. He leads the influential Compiler and Architecture Design (CArD) Group at the University of Edinburgh and is a founder of the HiPEAC Network of Excellence, which has grown into a major European initiative connecting researchers and practitioners in high-performance and embedded computing.

Afonso S. Bandeiraمشاهده پروفایل

استاد

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +۳ مورد دیگر

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

David Nadlerمشاهده پروفایل

استاد

• Geometric Representation Theory
• Symplectic Geometry
• Langlands Duality
• +۳ مورد دیگر

David Nadler is a Professor in the Department of Mathematics at the University of California, Berkeley, appointed in 2012. His research centers on geometric representation theory and symplectic geometry, with significant contributions to the Langlands program, microlocal sheaf theory, and symplectic topology. He maintains an active research group and teaches courses ranging from undergraduate linear algebra to graduate algebraic topology and geometry. Nadler's research explores the interface of algebraic geometry, topology, and representation theory. His work in geometric representation theory focuses on Langlands duality, Springer theory, and Betti geometric Langlands. In symplectic geometry, he investigates microlocal sheaves, Fukaya categories, and Weinstein structures. His recent publications demonstrate a consistent focus on categorical methods in geometric Langlands correspondence and symplectic arborealization. His publications consistently emphasize categorical and geometric approaches to representation theory. Recent works cluster in three areas: (1) extensions of the geometric Langlands program to Betti cohomology settings, (2) microlocal analysis of sheaves on symplectic manifolds, and (3) combinatorial models in symplectic topology. This reflects sustained development of 'Betti geometric Langlands' as a distinct research program bridging topology and automorphic forms. Nadler has advised over a dozen PhD students since 2012, with dissertations spanning geometric representation theory, symplectic geometry, and algebraic topology. Student projects frequently investigate categorical aspects of geometric Langlands, microlocal sheaves, and combinatorial models in symplectic topology.

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

استاد

• Representation Theory
• Noncommutative Algebra
• Monoidal Categories
• +۳ مورد دیگر

Kevin Coulembier is a Professor in the Algebra Research Group at the University of Sydney . He has held a continuing position since 2017 and received prestigious awards including the Christopher Heyde Medal (2021), G. de B. Robinson Award (2022), and the Frontiers of Science Award (2024). Research Focus: Representation theory of algebraic groups, Lie (super)algebras, quantum groups, and monoidal categories; tensor ideals; and homological algebra. Grants: ARC Future Fellowship (2023), ARC Discovery Projects (2021, 2018), and DECRA Fellowship (2017). Students: Supervised postdocs and PhD students including Nick Bridger, Joseph Newton, Bregje Pauwels, Alexander Sherman, and Willow Stewart. Editorial Roles: Editor for Annals of Representation Theory and Mathematische Zeitschrift .

• Scientific Machine Learning
• Numerical Linear Algebra
• Numerical Multilinear Algebra
• +۷ مورد دیگر

Peter Benner is a Professor and Director at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, where he leads the Computational Methods in Systems and Control Theory group. He also holds an Honorarprofessor position for Mathematics at Otto-von-Guericke Universität Magdeburg since 2011. Benner has previously served as Managing Director of the Max Planck Institute during multiple periods (2013-2014, 2021-2022, and 2025-2026), demonstrating his leadership in the field. Benner's research focuses on Scientific Machine Learning, Numerical Linear and Multilinear Algebra, Model Order Reduction and Reduced-order Modeling, Numerical Methods in Systems and Control Theory, PDE Constrained Optimization, High-performance and Power-aware Computing, and Mathematical Software development. His work bridges theoretical mathematics with practical engineering applications, particularly addressing challenges in large-scale dynamical systems. Analysis of his recent publications reveals a strong emphasis on developing efficient computational methods for complex systems. Benner has pioneered approaches combining model order reduction with tensor methods to tackle high-dimensional problems in uncertainty quantification and PDE-constrained optimization. His work shows a consistent trend toward integrating data-driven techniques with traditional model-based approaches, particularly for nonlinear and parametric systems. Throughout his career, Benner has actively mentored students and collaborated with researchers worldwide, delivering numerous invited talks at prestigious institutions and conferences across Europe, North America, and Asia. His research has received significant funding, supporting the development of mathematical software and computational methods for industrial applications. Benner leads the Computational Methods in Systems and Control Theory department at the Max Planck Institute, which focuses on developing and implementing advanced numerical methods for large-scale dynamical systems. The group maintains strong connections with both theoretical mathematics and practical engineering applications, particularly in fluid dynamics, energy systems, and control theory.

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

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.

Baijian Yangمشاهده پروفایل

استاد

• Cybersecurity
• Big Data
• Applied Machine Learning
• +۴ مورد دیگر

Dr. Baijian "Justin" Yang serves as the Associate Dean for Research at Purdue Polytechnic Institute and is a Professor in the Department of Computer and Information Technology at Purdue University. He earned his Ph.D. in Computer Science from Michigan State University, with Master's and Bachelor's degrees in Automation (EECS) from Tsinghua University. Dr. Yang has established himself as a leader in multiple interdisciplinary research domains. Dr. Yang's educational background includes: PhD in Computer Science, Michigan State University (2002) MS in Automation (EECS), Tsinghua University (1998) BS in Automation (EECS), Tsinghua University (1995) His research interests span multiple cutting-edge domains with practical applications: Cybersecurity : Developing novel approaches for threat intelligence, security education, and network defense Big Data : Creating innovative algorithms for dimension reduction, regression with categorical variables, and tensor decomposition Applied Machine Learning : Implementing AI solutions in healthcare, manufacturing, and forestry applications Digital Forestry : Using UAV imagery and remote sensing for forest management and tree species classification Dr. Yang's publication record demonstrates significant impact across multiple disciplines, with recent work focusing on spatial transcriptomics analysis (SiGra), delirium detection using limited-lead EEG, and visual localization technologies. His research bridges theoretical advances with practical applications in healthcare, manufacturing quality control, and environmental monitoring. The interdisciplinary nature of his work is evident in collaborations spanning computer science, healthcare, forestry, and manufacturing domains. His scientific achievements have been recognized with numerous awards: 2023 HRSA Building Bridges to Better Health Competition Winner (Phase 1) and 2nd place ($100,000 prize) in Phase 3 2023 Outstanding Faculty Award in Engagement, Department of Computer and Information Technology, Purdue University 2021 Leadership in Manufacturing Award, Manufacturing Times Digital (MxD) 2021 Good to Great Award, Purdue Polytechnic 2020 Outstanding Faculty Award in Discovery, Department of Computer and Information Technology 2019 University Faculty Scholars, Purdue University As an educator and mentor, Dr. Yang has advised numerous graduate students through their PhD and Master's research. His leadership extends to significant service roles including serving as Faculty Champion for the Holistic Safety and Security research impact area at Purdue Polytechnic from 2018 to 2021, board membership with ATMAE (2014-2016), and participation in the IEEE Cybersecurity Initiative Steering Committee (2015-2017). He holds valuable industry certifications including CISSP, MCSE, and Six Sigma Black Belt, demonstrating his commitment to bridging academic research with industry practice. Dr. Yang leads multiple research projects including "Digital Forestry" for developing tools to quantify forest function, "CHEESE" (Cyber Human Ecosystem of Engaged Security Education), and "CICI" (Supporting Controlled Unclassified Information with a Campus Awareness and Risk Management Framework). His work on "Applied Machine Learning" focuses on solving real-world problems, while his "Dimension Reduction and Memory Amnestic Big Data Regression" project innovates computational algorithms for large-scale data analysis.

• Mathematics
• Machine Learning
• Quantum Topology
• +۹ مورد دیگر

Sergei Gukov is the John D. MacArthur Professor of Theoretical Physics and Mathematics at the California Institute of Technology (Caltech), where he has been a faculty member since 2005. He serves in the Division of Physics, Mathematics and Astronomy, with primary affiliation in the Department of Mathematics. His research bridges the fields of mathematics and theoretical physics, focusing on deep connections between geometry, topology, and quantum field theory. Gukov received his B.S. from Moscow Institute of Physics and Technology in 1997, followed by an M.S. and Ph.D. from Princeton University in 2001. He joined Caltech as an Associate Professor in 2005, was promoted to Professor in 2007, and was named the John D. MacArthur Professor in 2021. His research spans several interconnected areas at the frontier of mathematics and physics. A central theme is the exploration of quantum topology and its connections to mathematical physics. He has made significant contributions to the geometric Langlands program, gauge theory, and the categorification of knot and 3-manifold invariants. His recent work increasingly incorporates machine learning approaches to mathematical problems, reflecting his interest in the intersection of traditional mathematical research and modern computational techniques. Gukov's work often reveals deep connections between seemingly disparate areas of mathematics and physics, such as the relationship between Rozansky-Witten geometry and Coulomb branches in supersymmetric gauge theories. Gukov's publications demonstrate a consistent focus on the mathematical structures underlying quantum field theories and their topological implications. His recent work shows an increasing emphasis on computational approaches to mathematical problems, particularly through his interest in mathematics and machine learning. The recurring themes across his research include the application of physical insights to solve mathematical problems and the discovery of new mathematical structures through physical reasoning. He serves on the editorial boards of several prestigious journals including the Journal of Knot Theory and Its Ramifications, Communications in Mathematical Physics, and Letters in Mathematical Physics. Gukov is also active in the academic community, having delivered plenary talks at major conferences such as the First International Congress of Basic Science and presenting at String Math 2023 on the potential impact of AI on mathematical research. Gukov teaches Ma 146 ab, Introduction to Knot Theory and Quantum Topology, a course that reflects his research interests. He also runs a seminar on Mathematics and Machine Learning, held Tuesdays from 2-3pm in East Bridge Conference room 114, demonstrating his commitment to fostering interdisciplinary research at the intersection of mathematics and computational methods.

Jianqi Liuمشاهده پروفایل

پژوهشگر ارشد

• Vertex Operator Algebras
• Conformal Field Theory
• Mathematical Physics
• +۳ مورد دیگر

Jianqi Liu is a Hans Rademacher Research Fellow in the Department of Mathematics at the University of Pennsylvania, affiliated with the School of Arts and Sciences. His research focuses on vertex operator algebras (VOAs) and 2D conformal field theory (CFT), with an emphasis on algebraic structures such as fusion rules, Zhu’s algebras, Borel-type subalgebras, and connections to the classical Yang-Baxter equation. He also explores geometric aspects of VOAs and their physical interpretations. He earned his Ph.D. in Mathematics from the University of California, Santa Cruz (2018–2023), under the supervision of Chongying Dong. Prior to his current role, he held teaching roles at both UPenn and UCSC, instructing courses ranging from advanced linear algebra to complex analysis and number theory. His research publications address topics such as twisted conformal blocks, Rota-Baxter operators, and the interplay between algebraic structures and integrable systems. Liu collaborates with researchers like Angela Gibney and Daniel Krashen, focusing on advancing theoretical frameworks in mathematical physics and algebraic geometry.