جستجوی استاد راهنمای دانشگاهی

Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .

• Dynamical Systems
• Analytic Number Theory
• Diophantine Approximation
• +۵ مورد دیگر

Prof. Dr. Nina Gantert is a distinguished Professor of Probability Theory at the Technical University of Munich (TUM) , affiliated with the TUM School of Computation, Information and Technology . She has held faculty positions at Karlsruhe Institute of Technology and the University of Münster prior to joining TUM in 2011. Her research focuses on probability theory , particularly stochastic processes , large deviations , and random media . She investigates random walks in random environments as models for transport in disordered systems and explores applications in physics and biology . Recent publications highlight her work on branching random walks , mixing times , biased random walks , and large deviation principles for complex stochastic systems. She has co-authored studies on random walks in dynamical percolation , interacting edge-reinforced processes , and extremal point processes in branching models. Scientific Awards: Elected fellow of the IMS (2016) Her academic career spans institutions including ETH Zürich, University of Bonn, Technical University of Berlin, and TUM. She has supervised numerous Bachelor’s and Master’s theses on topics ranging from mixing time analysis to percolation theory , often collaborating with international co-authors.

• Probability Theory
• Stochastic Processes
• Large Deviations
• +۴ مورد دیگر

Andre Wibisono serves as Assistant Professor in Yale University's Department of Computer Science with a secondary appointment in Statistics & Data Science, joining the faculty in 2021 after postdoctoral research at University of Wisconsin-Madison and Georgia Institute of Technology. His educational background includes: Ph.D. in Computer Science, UC Berkeley M.A. in Statistics, UC Berkeley M.Eng. in Computer Science, MIT S.B. in Mathematics and Computer Science, MIT Wibisono's research focuses on algorithm design for machine learning through optimization, sampling, and game theory , leveraging dynamical systems and information theory to develop accelerated discrete-time algorithms from continuous dynamics. His work provides theoretical foundations for efficient machine learning systems with applications in generative modeling and constrained optimization. Recent publications (2023-2025) demonstrate consistent innovation in Hamiltonian-based optimization , constrained-space sampling , and min-max game convergence , characterized by rigorous mathematical analysis connecting continuous dynamics to discrete algorithms. Key trends include randomized integration for acceleration, phi-divergence convergence guarantees, and symplectic geometry applications to mirror descent. Scientific recognition includes: NSF CAREER Award for developing algorithmic frameworks bridging continuous and discrete dynamics He actively mentors current students (Siddharth Mitra, Kaylee Yang, Jane Lee, Qiang Fu, Peter Wang) and has guided two postdocs to faculty positions. Research is funded through the NSF CAREER award and collaborative CIF grants focused on Hamiltonian dynamics for sampling and optimization. His Yale research group develops theoretical foundations for next-generation machine learning algorithms, emphasizing mathematical rigor in optimization and sampling with applications to generative modeling and constrained inference problems.

• Machine Learning
• Optimization
• Sampling
• +۴ مورد دیگر

David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).

• Graph Algorithms
• Computational Geometry
• Graph Theory
• +۳ مورد دیگر

Lawrence C. Washington is a Professor of Mathematics at the University of Maryland, College Park . His office is located in Mathematics Building 1105, and he can be reached at lcw@math.umd.edu . Teaching & Courses: In Spring 2023 he is teaching Cryptography 456 (TuTh 11:00–12:15) and co-organising the Algebra Seminar (MW 2–3). Office hours are held Tuesdays 1:30–2:30 and Thursdays 10:00–10:50. Research Interests: His work centres on number theory , with particular emphasis on cyclotomic fields , elliptic curves , cryptology , and Iwasawa theory . He has made extensive contributions to the study of p-adic L-functions , class groups , heuristics for class numbers , and the arithmetic of elliptic curves, often bridging deep theoretical questions with computational investigations. Textbooks & Scholarly Output: Washington is the author of several widely-used textbooks: Introduction to Cryptography with Coding Theory (3rd ed.) Introduction to Cyclotomic Fields Elliptic Curves: Number Theory and Cryptography An Introduction to Number Theory with Cryptography (2nd ed.) Elementary Number Theory Recent Publication Trends: Over the past five years his papers have focused on heuristics for Iwasawa invariants , anti-cyclotomic extensions , class groups of real cyclotomic fields , and analytic estimates for sums of prime powers . The work is characterised by a synthesis of algebraic, analytic, and computational techniques, frequently yielding explicit examples and numerical data that inform broader conjectures in algebraic number theory. Extracurricular Interests: Outside mathematics, Washington enjoys running and playing the bassoon , and he maintains a light-hearted page devoted to his favourite intersection in Chevy Chase, MD. Advising & Grants: While the provided text does not enumerate individual students or specific grants, his extensive publication record and long-standing professorship indicate ongoing supervision of graduate research and participation in funded projects in number theory and cryptography.

• Number theory
• Cyclotomic fields
• Elliptic curves
• +۵ مورد دیگر

Giorgis Petridis is an Associate Professor at the University of Georgia, specializing in arithmetic combinatorics, a field rooted in combinatorial number theory with modern extensions into discrete analysis and finite field geometry. Born in Athens, Greece, he earned his PhD from the University of Cambridge under Tim Gowers and held a Visiting Assistant Professor position at the University of Rochester. He serves as an editor for Combinatorial Theory and is affiliated with the Number Theory and Arithmetic Geometry group, particularly its additive combinatorics and discrete analysis subgroup. Doctor of Philosophy (2011), University of Cambridge Certificate of Advanced Studies in Mathematics (2002), St John’s College, Cambridge BA (Hons) in Mathematics (2001), St John’s College, Cambridge His research focuses on additive combinatorics, exploring sumset estimates, polynomial configurations in prime lattices, and geometric incidence problems over finite fields. He investigates combinatorial geometry, including pinned distance problems and bisector arrangements, while also contributing to exponential sum bounds and expander graph theory. His work bridges theoretical mathematics with applications in pseudorandomness and discrete geometry. Recent publications highlight trends in finite field analysis, with 6 of 15 articles addressing arithmetic structures in prime-order fields. Key keywords include Combinatorics , Number Theory , and Finite Fields , with sub-fields spanning polynomial configurations, energy bounds, and geometric combinatorics. Scientific awards include the Creative Research Medal (2024) from the University of Georgia for mid-career research impact. Grants from the Simons Foundation (MPS-TSM-00007816) and multiple NSF DMS Awards (2054214, 1723016, 1500984, 1804049) support his work on discrete analysis and conferences. He co-advises five PhD students and has supervised multiple Master’s theses on topics like point-plane incidences and additive energy. Outreach includes leading high school math teams, organizing discrete analysis sessions, and contributing to public science communication guides.

• Arithmetic Combinatorics
• Combinatorial Geometry
• Number Theory
• +۳ مورد دیگر

Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.

• Additive Combinatorics
• Analytic Number Theory
• Harmonic Analysis
• +۳ مورد دیگر

Ghaith Hiary is a Professor and Vice Chair for Graduate Recruitment in the Department of Mathematics at The Ohio State University. He holds a PhD from the University of Minnesota (2008). His research focuses on computational and analytic number theory, with emphasis on the Riemann zeta function, L-functions, random matrix theory, and asymptotic analysis. Hiary's work bridges theoretical mathematics and high-performance computation. He develops efficient algorithms (e.g., amortized-complexity methods) to evaluate zeta functions at extreme heights (e.g., near t=10 28 ), implemented in C++/Mathematica. His research uses random matrix models to study zeta-function moments and employs techniques like van der Corput estimates and hybrid methods for explicit bounds. His publications demonstrate consistent focus on zeta-function computations, factorization algorithms, and arithmetic biases. Recent work (2022-2025) explores invariant measures, Lehman's method generalizations, and sign changes in random multiplicative functions, maintaining strong ties to analytic and probabilistic number theory. Hiary shares code and datasets via GitHub, including implementations of T 1/3 algorithms for zeta computations. He collaborates with institutions like the University of Waterloo and maintains numerical databases of zeta zeros.

• Computational Number Theory
• Analytic Number Theory
• Random Matrix Theory
• +۳ مورد دیگر

Ioannis Panageas is an Assistant Professor in Computer Science at UC Irvine's Donald Bren School, directing the GOALLab. His research develops theory for learning in multi-agent systems, game dynamics, and optimization. Funded by NSF and NRF, he focuses on last-iterate convergence guarantees in games, efficient equilibrium computation, and multi-agent reinforcement learning. Recent Work: Provides first exponential lower bounds for fictitious play in potential games (NeurIPS 2023), efficient Nash equilibrium computation methods (ICLR 2023), and semi-bandit learning dynamics with no-regret guarantees (ICML 2023). Teaching: Offers courses in Algorithmic Game Theory and Optimization for Machine Learning. Currently advising 3 PhD students and 2 MS students.

• Algorithmic Game Theory
• Multi-agent Reinforcement Learning
• Optimization
• +۲ مورد دیگر

Emmanuel Kowalski is a Professor of Mathematics at ETH Zurich , where he has been since 2008. Previously, he held professorships at Université Bordeaux I (2000–2007) and was a Veblen Research Instructor at Princeton University and the Institute for Advanced Study (1998–2000). His research focuses on analytic number theory, automorphic forms, and algebraic geometry. Education: École Normale Supérieure de Lyon (1989–1992); PhD in Mathematics from Rutgers University (1998). Research Interests include automorphic forms, L-functions, sieve methods, exponential sums, and probabilistic number theory. His work often bridges number theory with algebraic geometry and harmonic analysis. He has authored over 70 research papers and 6 books, including the influential Analytic Number Theory (2004) with Henryk Iwaniec. Scientific Awards and Invitations include the von Neumann Visiting Fellowship at IAS Princeton (2009), membership in the Board of the Institut des Hautes Études Scientifiques (2016–present), and four invitations to lecture at the prestigious Bourbaki Seminar. He has also delivered key lectures at the Riemann International School of Mathematics and conferences honoring major mathematicians. Grants and Leadership He has organized numerous conferences and research programs, including the 2019 Arithmetic, geometry and modular forms conference at FIM and the 2022 goMath program on Women in Mathematics. He co-leads projects funded by the Swiss National Science Foundation (SNF), such as Trace functions and arithmetic Fourier transforms .

• Automorphic forms
• L-functions
• Analytic Number Theory
• +۵ مورد دیگر

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.

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

Keith Conrad is an Associate Professor in the Department of Mathematics at the University of Connecticut (UConn), part of the College of Liberal Arts and Sciences. His research focuses on Number Theory, particularly in areas such as algebraic and analytic number theory, prime numbers, arithmetic geometry, and modular forms. He has published extensively on topics like congruent numbers, prime specialization, and the Möbius function. His work integrates classical number theory with modern algebraic techniques, contributing to foundational understanding in the field. Conrad is actively involved in academic outreach, organizing and teaching at programs like the Ross Mathematics Program and PROMYS. He has delivered lectures on advanced topics such as L-functions, the Riemann Hypothesis, and the ABC conjecture. His expository papers and teaching materials emphasize clarity and accessibility, bridging gaps between complex mathematical concepts and broader audiences. Conrad's academic contributions include significant publications in journals like *Mathematics Magazine* and *Journal für die reine und angewandte Mathematik*, as well as expository works on modular forms, prime patterns, and historical aspects of representation theory. He maintains a comprehensive website with resources for students and researchers, including detailed lecture notes, problem sets, and links to mathematical tools and software.

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

Francesco Cellarosi is an Associate Professor in the Department of Mathematics and Statistics at Queen's University, within the Faculty of Arts and Science. His research focuses on the intersection of dynamics, probability theory, ergodic theory, number theory, and mathematical physics. He investigates how classical number-theoretic objects exhibit random features, employing dynamical methods such as spectral theory of group actions and analysis of flows on homogeneous spaces. Educational Background: PhD in Mathematics (2011), Princeton University MSc in Mathematics (2007), Princeton University Laurea Magistrale (Master's) in Mathematics (2006), Università degli Studi di Bologna Research Interests: Dr. Cellarosi explores probabilistic phenomena in number theory, including theta sums, quadratic Weyl sums, and k-free integers. His work bridges ergodic theory and quantum mechanics, analyzing autocorrelation functions and spectral properties of physical systems. Key themes include limit theorems, random processes of number-theoretic origin, and applications to statistical mechanics. Professional Profile: He teaches advanced courses such as MATH 892 and MATH/MTH 328. His office is Jeffery Hall 506, and he maintains a Google Scholar profile and personal website. No awards are explicitly listed, but his extensive publication record reflects scholarly contributions. Labs/Teams: While no specific labs are mentioned, his collaborations span pure mathematics and mathematical physics, often involving interdisciplinary dynamics and probability.

• Pure Mathematics
• Probability Theory
• Number Theory
• +۳ مورد دیگر

Lillian Beatrix Pierce is a Professor of Mathematics at Duke University, affiliated with the Trinity College of Arts & Sciences. She holds a B.A. from Princeton University (2002), an M.Sc. from the University of Oxford (2004), and a Ph.D. from Princeton University (2009). Her research focuses on analytic number theory and harmonic analysis, exploring intersections between oscillating functions, Diophantine equations, and arithmetic structures. Pierce has been recognized with prestigious awards, including the 2023 Guggenheim Fellowship, the 2018 Sloan Research Fellowship, and the 2019 PECASE award. She leads research grants from the NSF and Simons Foundation, investigating topics like class groups, character sums, and oscillatory integrals. Her work bridges number theory and harmonic analysis, with contributions to sieve methods, maximal operators, and decoupling techniques. She serves on editorial boards for journals like the Journal of the AMS and Duke Mathematical Journal. Pierce also advocates for accessibility in mathematics, co-founding the journal Essential Number Theory to disseminate foundational research. Her academic journey includes roles as a von Neumann Fellow at the Institute for Advanced Study and a Rhodes Scholar. Notable publications include breakthroughs on the Vinogradov mean value theorem, ℓ-torsion in class groups, and polynomial Carleson operators. She actively mentors and collaborates in global research networks, fostering interdisciplinary approaches to mathematical challenges.

• Analytic Number Theory
• Harmonic Analysis
• Number Theory
• +۱ مورد دیگر

Cynthia Vinzant is an Associate Professor in the Department of Mathematics at the University of Washington. Her research focuses on real algebraic geometry, combinatorics, and convex optimization, with applications to hyperbolic polynomials, determinantal representations, and convex algebraic geometry. She collaborates extensively on projects involving numerical ranges, quasicrystals, and geometric optimization problems. Research Interests: Real algebraic geometry and its connections to combinatorics and optimization Hyperbolic and log-concave polynomials Convex geometry and spectrahedra Applications in matrix analysis and statistical mechanics Her work spans theoretical advances in algebraic geometry and computational methods, including contributions to the study of principal minors, tropical geometry, and phase retrieval problems. Recent publications highlight her focus on Fourier quasicrystals, higher-rank numerical ranges, and combinatorial structures in matroids. Publications: Over 30 peer-reviewed articles, including influential works on quartic curves, determinantal representations, and log-concave polynomials. Grants & Collaborations: Active in interdisciplinary research, with projects supported by NSF and collaborations in algebraic combinatorics and geometric optimization.

• Real Algebraic Geometry
• Combinatorics
• Convex Optimization
• +۳ مورد دیگر