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

Yakov Pesinمشاهده پروفایل

استاد

• Dynamical Systems
• Ergodic Theory
• Riemannian Geometry
• +۳ مورد دیگر

Yakov Pesin is a Distinguished Professor of Mathematics at Pennsylvania State University, affiliated with the Department of Mathematics and serving as Director of the Anatole Katok Center for Dynamical Systems and Geometry. He holds positions in the Eberly College of Science. His research focuses on Dynamical Systems, Ergodic Theory, Riemannian Geometry, and Mathematical Physics. Born in Moscow, he earned an MS from Moscow State University (1970) and a PhD from Gorky State University (1979). He has been a member of prestigious academies, including the American Academy of Arts and Sciences and the European Academy. His work includes seminal contributions to nonuniform hyperbolicity theory and entropy analysis. His research interests emphasize the interplay between dynamics, geometry, and statistical physics, with notable studies on SRB measures, Lyapunov exponents, and geometric flows. Awards include the Michael Brin Prize in Dynamical Systems and the inaugural Fellow of the American Mathematical Society. Pesin has advised multiple students and collaborators, though specific names are not listed. He directs the Katok Center, fostering interdisciplinary research. His publications (15 most recent listed) explore topics like thermodynamic formalism, hyperbolicity, and entropy, reflecting his leadership in dynamical systems theory.

Max Alekseyevمشاهده پروفایل

دانشیار

• Computational Graph Theory
• Enumerative Combinatorics
• Computational/Algorithmic Biology
• +۱ مورد دیگر

Max Alekseyev is an Associate Professor in the Mathematics Department and Computational Biology Institute. His research spans computational graph theory, enumerative combinatorics, computational/algorithmic biology, and comparative genomics. He focuses on interdisciplinary problems, blending mathematics with biological applications, particularly in genome assembly and analysis. His work includes advancements in genome scaffolding algorithms, combinatorial sequence analysis, and mathematical biology. Notable contributions involve genome assembly tools like CAMSA and studies on ancestral genome reconstruction. He also explores theoretical topics such as Bernoulli series generalizations and modular data classification. His research trends highlight a blend of pure mathematics (e.g., number theory, graph theory) and applied computational methods, addressing challenges in genomics and evolutionary biology. He secured an NSF Student Travel Grant in 2018 for computational molecular biology.

Maizie Zhouمشاهده پروفایل

استادیار

• Computational Genomics
• Bioinformatics
• Computational Neuroscience
• +۶ مورد دیگر

Maizie Zhou is an Assistant Professor in Biomedical Engineering and Computer Science at Vanderbilt University’s School of Engineering. She holds dual PhDs in Computer Science (Stanford University) and Neuroscience (Wake Forest School of Medicine), with additional degrees from Wake Forest University and Huazhong University of Science and Technology. Her research focuses on computational genomics, bioinformatics, and machine learning applied to problems in cancer genomics, single-cell and spatial transcriptomics, and computational neuroscience. She leads the Zhou Lab, which develops algorithms for structural variant detection, neural circuit analysis, and integrative omics approaches. Recent work includes tools like VolcanoSV and stDyer, and she has received grants from NIH, Vanderbilt Brain Institute, and industry partnerships. Key achievements include VUSE Best Paper Awards, Global Engagement Travel Grants, and mentoring students in prestigious programs like the Provost’s Pathbreaking Discovery Award. Her lab also explores the neural underpinnings of cognitive maturation in primates, combining computational and experimental neuroscience. Education: PhDs in Computer Science (Stanford) and Neuroscience (Wake Forest), MS (Computer Science, Wake Forest), BS (Biotechnology, Huazhong). Research interests span computational genomics (e.g., structural variant detection, haplotype phasing), spatial transcriptomics (clustering, integration), and computational neuroscience (neural circuit dynamics, prefrontal cortex plasticity). Her lab’s tools address challenges in precision medicine, cancer genomics, and understanding adolescent brain development. Recent projects include NIH-funded work on spatial transcriptomics and collaborations with Dr. Meltzer’s lab on cancer genomics. Publications highlight advancements in bioinformatics tools and neural mechanisms, with trends toward multi-omics integration and algorithmic innovation in genomics. Awards include the Global Engagement Travel Grant and CCSB Accelerator Fund. Students under her mentorship have excelled in qualifying exams and travel grants, reflecting her impactful training program.

Nathan Kaplanمشاهده پروفایل

استاد

• Number Theory
• Algebraic Geometry
• Combinatorics
• +۶ مورد دیگر

Nathan Kaplan is a Professor in the Department of Mathematics at the University of California, Irvine, where he conducts research in number theory, algebraic geometry, and combinatorics. His work spans rational points on varieties over finite fields, arithmetic statistics, coding theory, and the study of numerical semigroups. He is actively involved in the mathematical community, organizing seminars and conferences including the UC Irvine Number Theory Seminar and the Southern California Number Theory Day. Dr. Kaplan received his PhD from Harvard University in 2013 under the direction of Noam Elkies. Following his doctorate, he was a postdoctoral researcher at Yale University from 2013-2015 before joining the faculty at UC Irvine. His research interests focus on the intersection of number theory and algebraic geometry, with particular attention to problems involving rational points on varieties over finite fields, arithmetic statistics, and coding theory. He has made significant contributions to the study of numerical semigroups, cokernels of random p-adic and integer matrices, and quadratic forms and lattices. His work often bridges theoretical mathematics with applications in coding theory and cryptography. Analysis of his recent publications shows a strong trend toward combinatorial aspects of number theory, particularly in the study of numerical semigroups and their properties. He frequently collaborates with researchers across institutions, with recent work spanning algebraic geometry, combinatorics, and coding theory. His publications demonstrate expertise in both theoretical developments and computational aspects of number theory. Dr. Kaplan is deeply committed to undergraduate research and mentoring. He has experience as a mentor for undergraduate research projects through programs including SUMRY (a research program for Yale undergraduates), the University of Minnesota-Duluth REU program, and the Trinity University REU program. He actively encourages undergraduates to apply for summer research opportunities and has organized numerous outreach activities. He is an organizer of the UC Irvine Number Theory Seminar and the Southern California Number Theory Day conference series. In 2018, he co-organized the Conference on Open Questions in Cryptography and Number Theory in honor of Alice Silverberg's 60th Birthday. Dr. Kaplan has given numerous talks at mathematical venues including the Museum of Mathematics' Math Encounters series, where he presented "Error-Correcting Codes: The Mathematics of Communication" in July 2022. He has also spoken at the Yale Undergraduate Math Society, the UCI Math Circle, and various other outreach events.

Xiaochun Liمشاهده پروفایل

استاد

• Harmonic Analysis
• Functional Analysis
• Differential Equations
• +۳ مورد دیگر

Xiaochun Li is a Professor of Mathematics at the University of Illinois at Urbana-Champaign, affiliated with the Department of Mathematics within the College of Liberal Arts & Sciences. His research focuses on Harmonic Analysis, with expertise in multilinear oscillatory integrals, Hilbert transforms along vector fields, and multilinear Carleson theorems. He earned his Ph.D. from the University of Missouri at Columbia in 2001. His recent work explores topics such as pointwise convergence of cone multipliers, Stein-Tomas restriction theorems, and polynomial Roth theorems. These studies bridge functional analysis, Fourier analysis, and operator theory, contributing to foundational advancements in mathematical analysis. No scientific awards or grants are explicitly listed in the provided materials. His research is supported through his academic appointment, and he maintains an active publication record in prestigious journals such as the Journal of Functional Analysis and Mathematische Annalen.

• Number Theory
• Algebra
• Langlands Program
• +۳ مورد دیگر

Bence Hevesi is a MathInGreaterParis Postdoctoral Fellow at the Laboratoire de Mathématiques d'Orsay, affiliated with Université Paris-Saclay. Previously, he completed his PhD (2020–2023) at the London School of Geometry and Number Theory (LSGNT), a collaboration between King's College London, Imperial College London, and University College London. His primary supervisor during his PhD was Professor Fred Diamond, with additional supervision by Ana Caraiani. He holds a Master's degree in Mathematics, supervised by David Hansen, focusing on the Geometry of the de Rham affine Grassmannian . Research Interests: Bence specializes in Number Theory, particularly the Langlands program. His work explores global and p-adic aspects, including automorphic forms, Galois representations, and arithmetic geometry. He actively contributes to advancing methodologies in p-adic Hodge theory and representation theory. Publications/Preprints: His recent preprint, Ordinary parts and local-global compatibility at l=p , reflects his engagement with cutting-edge topics in number theory. This work bridges local and global perspectives in the Langlands program, with implications for understanding p-adic structures in arithmetic geometry. Awards & Grants: No specific awards or grants are mentioned, but his postdoctoral fellowship under MathInGreaterParis highlights institutional recognition of his research potential. His PhD at LSGNT was supported by the UK's Engineering and Physical Sciences Research Council (EPSRC). Labs & Collaborations: Based at Laboratoire de Mathématiques d'Orsay, he collaborates with leading researchers in arithmetic geometry and number theory. His work intersects with CNRS and international networks, fostering interdisciplinary advancements in algebraic number theory.

Leo Goldmakherمشاهده پروفایل

دانشیار

• Number Theory
• Cryptography
• Topology
• +۷ مورد دیگر

Leo Goldmakher is an Associate Professor of Mathematics at Williams College, where he teaches courses in cryptography, topology, Fourier analysis, measure theory, and analytic number theory. He holds a B.A. in Mathematics from Princeton University (2004) and a Ph.D. in Mathematics from the University of Michigan (2009). Research interests Teaching areas Publications His research focuses on number theory, including topics such as Gauss sums, character sums, multiplicative functions, and analytic methods. He has contributed to refinements of classical theorems like Lagrange’s four-square theorem and Artin’s primitive root conjecture. His recent publications explore bounds on character sums, spectral properties of random graphs, and algebraic structures in number theory. The work demonstrates a strong emphasis on analytic and algebraic techniques. Leo has been affiliated with Williams College’s Department of Mathematics and Statistics, which received the 2014 Exemplary Department Award from the American Mathematical Society. He has taught advanced courses such as Cryptography, Topology, and Analytic Number Theory, though these were not offered in the 2025/26 academic year.

Steven Bradlowمشاهده پروفایل

استاد

• Differential Geometry
• Gauge Theory
• Algebraic Geometry
• +۳ مورد دیگر

Steven Bradlow is a Professor in the Department of Mathematics at the University of Illinois at Urbana-Champaign (UIUC), affiliated with the College of Liberal Arts & Sciences. His research focuses on differential geometry, gauge theory, algebraic geometry, and topology, with particular emphasis on Higgs bundles, moduli spaces, and geometric structures. He holds a PhD from the University of Chicago (1988) and has held additional campus roles as a Professor of Mathematics. Research Interests: Bradlow’s work explores advanced topics such as holomorphic vector bundles, stability conditions, and geometric invariant theory. His studies of Higgs bundles integrate techniques from algebraic geometry, differential geometry, and mathematical physics, addressing questions related to moduli spaces, spectral curves, and representation varieties. He investigates exotic components of surface group representations and their connections to Teichmüller theory, contributing to the broader understanding of geometric structures and their topological properties. Recent Work Trends: Recent publications highlight his focus on Cayley correspondences, higher rank Teichmüller spaces, and uniformization techniques for branched surfaces. His collaborative projects often bridge algebraic and differential geometry, with applications to gauge theories and geometric analysis. He has also contributed to editorial work honoring peers like Karen Uhlenbeck and Oscar García-Prada. Grants & Advising: While specific grant details are not listed, Bradlow has been involved in NSF-funded initiatives (e.g., EMSW21-MCTP, RNMS: Geometric Structures). His advising contributions are reflected in co-authored works with students/postdocs such as Brian Collier and Oscar García-Prada. He is associated with research networks exploring geometric representation theory and mathematical collaborations. Labs/Teams: Active within UIUC’s Department of Mathematics, Bradlow collaborates with researchers in geometry and topology. His work often intersects with interdisciplinary groups studying geometric structures, though specific lab affiliations are not detailed here.

Alireza Salehi Golsefidyمشاهده پروفایل

استاد

• Algebra
• Number Theory
• Combinatorics
• +۴ مورد دیگر

Alireza Salehi Golsefidy is a Professor in the Department of Mathematics at the University of California, San Diego (UCSD). He received his Ph.D. from Yale University under Gregory Margulis, a Fields Medalist. His research focuses on algebraic, arithmetic, and analytic properties of linear groups, homogeneous dynamical systems, and expander graphs. He has held positions at Princeton University and the Institute for Advanced Study as a Veblen Research Instructor before joining UCSD in 2011. Education: Ph.D. in Mathematics, Yale University (2006). Research Interests: His work bridges discrete subgroups of Lie groups, homogeneous dynamics, and number theory. Recent contributions include studies on super-approximation, spectral independence, and geometric group theory. He has organized workshops on thin groups, arithmetic groups, and homogeneous dynamics at MSRI and Oberwolfach. Grants & Awards: Alfred P. Sloan Research Fellowship (2012), Clay Liftoff Award (2006), NSF grants 1602137, 1902090, and 2302519. His research explores applications of expander graphs and random walks in algebraic structures. Teaching: Currently teaching Algebra (Math 200C) in Spring 2025. Past courses include advanced algebraic topology, representation theory, and graduate-level number theory. Labs/Teams: Co-organizes UCSD's Algebra Seminar and contributed to the 2013 Lie Theory Workshop. Active in collaborative projects on group actions and automorphic forms.

Zachary Kincaidمشاهده پروفایل

دانشیار

• Program Analysis
• Formal Methods
• Programming Languages
• +۴ مورد دیگر

Zachary Kincaid is an Associate Professor in the Department of Computer Science at Princeton University's School of Engineering and Applied Science. His research focuses on program analysis, logic, and programming languages, with an emphasis on making program analysis compositional and robust. He received his PhD from the University of Toronto under the supervision of Azadeh Farzan. His work has been implemented in the Duet program analyzer, and he has an Erdős number of 3. Dr. Kincaid's research interests include: Compositional program analysis techniques Algebraic approaches to program analysis Termination analysis and ranking function synthesis Verification of concurrent and parallel programs Automated reasoning and decision procedures Analysis of numerical programs and loops His recent publications show a strong focus on developing novel techniques for program analysis that bridge theoretical computer science with practical verification tools, particularly in nonlinear analysis, quantified reasoning, and compositional verification. Dr. Kincaid has received research support from ONR grant N00014-19-1-2318 for his work on robust program analysis. He has advised graduate students including: Current: Jake Silverman, Nicolas Koh, Nikhil Pimpalkhare Graduated: Shaowei Zhu (PhD 2024, Researcher at Amazon), Charlie Murphy (PhD 2023, Postdoc at University of Wisconsin–Madison) Dr. Kincaid teaches courses including: COS 320 – Compiling Techniques (Spring 2024, 2022, 2020, 2019) COS 516 / ELE 516 – Automated Reasoning about Software (Fall 2025, 2022, 2018) COS 217 – Introduction to Programming Systems (Fall 2024) COS IW – Practical Solutions to Intractable Problems (Fall 2023, Spring 2023, 2018, 2017) COS IW – Little Languages (Spring 2018) COS 597D – Reasoning about concurrent systems (Fall 2016)

Nathan Ngمشاهده پروفایل

استاد

• Analytic Number Theory
• Riemann Zeta Function
• L-functions
• +۲ مورد دیگر

Nathan Ng is a Professor in the Department of Mathematics and Computer Science at the University of Lethbridge , Canada, and has served as the PIMS Site Director since 2019. His research lies at the intersection of analytic number theory and L-functions, with a particular focus on the Riemann zeta function, prime number distribution, and multiplicative number theory. Education: He earned a B.Sc. from the University of British Columbia (1994), an M.Sc. from the University of Toronto (1995), and a Ph.D. from UBC (2000). His doctoral thesis, Limiting Distributions and Zeros of Artin L-functions , laid the groundwork for his subsequent research. Research Interests: His work spans a wide range of topics in analytic number theory, including: Mean values and moments of L-functions Non-vanishing of L-functions Distribution of zeros of the Riemann zeta function Prime number races and comparative prime number theory Chebotarev density theorem and applications Convolution sums of arithmetic functions Publications: He has published extensively in leading journals such as Proceedings of the London Mathematical Society , Duke Mathematical Journal , and Advances in Mathematics . His recent work includes studies on the sixth and eighth moments of the Riemann zeta function, subconvexity bounds for L-functions, and effective versions of Chebotarev's density theorem. Awards and Honors: He received the Canadian Mathematical Society Doctoral Prize in 2001 for his outstanding doctoral dissertation. Student Supervision: He has supervised or co-supervised numerous graduate students and postdocs, including: Ph.D. Students: Farzad Aryan (2016), Sourabhashis Das (ongoing), Quanli Shen (ongoing) M.Sc. Students: Allysa Lumley (2014), Majid Shahabi (2012) Postdocs: Lee Troupe, Peng-Jie Wong, Alia Hamieh, Timothy Trudgian, Brandon Fodden Seminar and Conference Organization: He is an active organizer of the Lethbridge Number Theory and Combinatorics Seminar and has co-organized major conferences such as the Canadian Number Theory Association (CNTA XII) meeting in 2012 and the Analytic Number Theory and Diophantine Approximation Summer School in Ottawa (2008). Labs and Teams: He is affiliated with the Lethbridge Number Theory Group , a vibrant research collective within the department that fosters collaboration and supports graduate training in number theory.

• graph algorithms
• optimization
• high-dimensional geometry
• +۳ مورد دیگر

Yang P. Liu is an Assistant Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. Previously, he was a Postdoctoral Member at the Institute for Advanced Study and earned his PhD from Stanford University under the supervision of Aaron Sidford. He completed his undergraduate studies at MIT, graduating in May 2018. His educational background includes: PhD in Computer Science, Stanford University (Advisor: Aaron Sidford) Bachelor's degree, Massachusetts Institute of Technology (graduated May 2018) Dr. Liu's research spans the intersection of mathematics and computer science, with particular focus on graph algorithms , optimization , high-dimensional geometry , and additive combinatorics . His work often develops novel algorithmic techniques that bridge theoretical insights with practical applications. He has made significant contributions to areas such as convex optimization, linear programming, and combinatorial problems. His teaching includes courses like "A Principled Approach to Optimization" (CS 15-759), which covers rigorous treatments of convex optimization topics including gradient descent, interior point methods, linear regression, linear programming, and sparsification. His extensive publication record in top-tier conferences (FOCS, STOC, SODA) demonstrates a consistent focus on developing almost-linear time algorithms for fundamental graph problems, optimization techniques, and combinatorial theorems. Recent work shows increasing emphasis on combinatorial lines, corners theorem, and k-CSP approximability, while maintaining strong connections to optimization theory and graph algorithms. Dr. Liu has received notable recognition for his work: National Defense Science and Engineering Graduate (NDSEG) Fellowship (2018-2021) Google PhD Fellowship (2022-2023) Best Paper award at FOCS 2022 for "Maximum Flow and Minimum-Cost Flow in Almost Linear Time" Best Student Paper at STOC 2021 for "Discrepancy Minimization via a Self-Balancing Walk" His research has been supported by prestigious fellowships including the NDSEG Fellowship and Google PhD Fellowship. His work on graph algorithms, optimization, and combinatorics involves collaborations with researchers across theoretical computer science and mathematics. His publications often involve co-authors from multiple institutions, suggesting active research collaborations across the field. Dr. Liu maintains an active research program with a focus on developing efficient algorithms for fundamental computational problems. His recent work continues to push the boundaries of what's computationally feasible in graph algorithms, optimization, and combinatorial mathematics, with particular emphasis on achieving almost-linear time complexity for challenging problems.

Oded Regevمشاهده پروفایل

استاد

• Theoretical Computer Science
• Lattice-based Cryptography
• Quantum Computation
• +۳ مورد دیگر

Oded Regev is a Silver Professor at the Courant Institute of Mathematical Sciences, New York University. He has previously held positions at Tel Aviv University and École Normale Supérieure, Paris (CNRS). His research spans theoretical computer science, cryptography, quantum computation, and machine learning applications in biological discovery. Education: PhD in Computer Science, Tel Aviv University (2001) Regev is renowned for his work in lattice-based cryptography, including the introduction of the Learning With Errors (LWE) problem and Gaussian measures. He also leads research using interpretable machine learning to decode RNA splicing logic and nuclear speckle dynamics, with implications in disease and therapeutics. His recent articles focus on quantum factoring, RNA localization, and geometric lattice bounds. Scientific Awards: European Research Council (ERC) Starting Grant (2008) 2018 Gödel Prize 2019 Simons Investigator Award Best Paper Awards: STOC 2003, Eurocrypt 2006 Regev mentors students and postdocs in both theoretical computer science and computational biology. His lab has secured funding from NSF, NIH, and Additional Ventures. He co-founded the TCS+ online seminar series and serves as Associate Editor-in-Chief for Theory of Computing .

Elon Lindenstraussمشاهده پروفایل

استاد

• Ergodic theory
• Topological dynamics
• Flows on homogeneous spaces
• +۶ مورد دیگر

Elon Lindenstrauss is a Professor at Hebrew University since 2008 and previously held faculty positions at Princeton University (2004-2010) and Stanford University (2001-2003). He is a member of the Academia Europaea (elected 2012) and has been affiliated with prestigious institutions including the Institute for Advanced Study (Princeton) and Courant Institute (NYU). Fields Medal recipient (2010) ERC Advanced Grant awardee (2011) Recipient of multiple fellowships including Clay Mathematics Institute (2003-2005) and Clore Fellowship (1998-1999) His research focuses span multiple mathematical disciplines: Ergodic theory and dynamical systems Homogeneous spaces and equidistribution Connections between number theory and quantum chaos Additive combinatorics and random walks As a leading mathematician, he has organized major conferences, including: 2013-14 Semester program at Hebrew University 2010 Oberwolfach workshop on Homogeneous Dynamics 2007 Clay Summer School on Homogeneous Flows

• Multi-criteria decision analysis
• Operations research
• Fuzzy sets and fuzzy numbers
• +۷ مورد دیگر

Matteo Brunelli is Associate Professor of “Mathematical Methods of Economics and Actuarial and Financial Sciences” at the University of Trento , Department of Industrial Engineering, and Adjunct Professor (docent) at Lappeenranta University of Technology , Finland. He is nationally habilitated as Full Professor in Italy and has held long-term visiting positions at Berkeley, Turku, Auckland, JAIST and Binghamton. Education: Ph.D. (Doctor of Science) in Information Technologies, Åbo Akademi University, Finland, 2011 – graded Eximia cum laude approbatur M.Sc. in Economics, University of Trento, 2007 – grade 110/110 cum laude B.Sc. in Economics, University of Trento, 2005 Research focus: Brunelli’s work sits at the intersection of multi-criteria decision analysis , operations research and computational optimisation . He develops axiomatic foundations and algorithms for pairwise comparison matrices , consistency indices , the best-worst method and fuzzy preference relations , and applies them to energy planning, sustainable inventory, maintenance scheduling, 3-D printer selection, and blockchain governance. His 2023-2025 articles reveal intensified interest in uncertainty modelling (Dempster-Shafer theory), bi-objective optimisation of inventory and maintenance, and group decision protocols that integrate probabilistic or active-learning components, demonstrating both methodological depth and practical relevance. Scientific awards & grants: Academy of Finland Postdoctoral Researcher grant (€254 670, 2014-2017) Claudio Dematté Research Grant (€19 000, 2008) Teacher of the Year Award, Aalto University (2013 – both Spring & Autumn semesters) Bernard Roy Award 2021 for outstanding contribution to Multiple Criteria Decision Aiding (under-40 category) Supervision & funding: While specific doctoral students are not listed, Brunelli currently supervises graduate theses at Trento and has continuously held competitive national grants. His Academy of Finland project “Consistency of valued preference relations for decision analytics methods” financed three years of full-time research and international collaboration. Editorial & community roles: He serves on the editorial boards of International Journal of General Systems and Mathematical and Computational Applications , and acts as area editor for Journal of Multi-Criteria Decision Analysis , positioning him among the key gatekeepers of the MCDA community.