Eric Larson is an Associate Professor at Brown University's Department of Mathematics, specializing in algebraic geometry. His research focuses on moduli spaces, Brill-Noether theory, and algebraic curves. He collaborates with notable mathematicians such as Isabel Vogt and Izzet Coskun on topics like normal bundles, Chow rings, and stability conditions. Larson actively engages in academic outreach, organizing Putnam competition practices and undergraduate colloquia. He has developed computational tools for studying elliptic curves' Galois representations and contributed to expository works on interpolation problems and LaTeX accessibility.
Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
James Maynard is a Professor of Number Theory at the University of Oxford , holding a Title IV Professorship equivalent to a UK chair or US full professor. He has held prestigious positions including Membership at the Institute for Advanced Study (Princeton, 2017), Research Membership at MSRI (Berkeley, 2017), and a Clay Research Fellowship (2015-2018). His research focuses on analytic number theory , particularly prime numbers and sieve methods , with groundbreaking work on prime gaps and Diophantine approximation. EDUCATION DPhil in Mathematics (2009-2013), Balliol College, Oxford Part III Mathematics (2008-2009), Queens’ College, Cambridge BA Mathematics (2005-2008), Queens’ College, Cambridge Maynard’s research explores the structure of prime numbers, including prime distribution , digital properties of primes , and norm form representations . His work has revolutionized understanding of bounded prime gaps and extremal prime spacing using advanced sieve techniques and probabilistic methods. Maynard’s publications (15 most recent) span analytic number theory , prime distribution , and Diophantine approximation . Key subfields include Bounded Gaps Between Primes , Digital Restrictions in Primes , Probabilistic Methods in Number Theory , and Algorithmic Sieve Optimization . Scientific Awards Fields Medal (2022) Cole Prize in Number Theory (2020) ERC Starting Grant (€1.5m, 2020-2025) Compositio Prize (2019) Wolfson Merit Award (2017) EMS Prize (2016) Erdős $10,000 Problem Prize (2016) Clay Research Fellowship (2015-2018) Whitehead Prize (2015) Ramanujan Prize (2014) Maynard has advised no explicitly named students but collaborates extensively in number theory. His grants include the ERC Starting Grant (2020-2025) and Wolfson Merit Award (2018-2023) . He has contributed to collaborative projects like the Polymath group and served as a Summer Consultant at GCHQ/Heilbronn Institute (2008-2012).
Professor Dinesh S. Thakur holds the position of Professor in the Department of Mathematics at the University of Rochester. He earned his PhD from Harvard University and has made significant contributions to number theory, arithmetic geometry, and function field arithmetic. His research focuses on developing theories related to zeta functions, Drinfeld modules, and p-adic analysis in finite characteristic environments. Education: PhD in Mathematics, Harvard University Research Interests: Thakur’s work integrates advanced topics such as elliptic curves, modular forms, Diophantine equations, and the arithmetic of function fields. He has pioneered studies on multizeta values, p-adic continued fractions, and the distribution of Diophantine exponents in finite characteristic. His research bridges classical number theory with modern algebraic geometry and p-adic analysis. Teaching & Mentorship: Thakur has taught a wide range of courses, including graduate-level topics in function field arithmetic, algebraic geometry, and number theory. He has advised 11 PhD students and several master’s students, whose theses span themes like elliptic Carmichael numbers, Drinfeld modular forms, and multizeta relations. Notable advisees include Javier Diaz-Vargas (1996), George Todd (2015), and Yao-Rui Yeo (2021). Outreach & Contributions: Thakur participates in initiatives like the Arizona Winter School and Olympiad training programs in India. He maintains an active seminar series at UR on topics such as L-values, Fermat’s Last Theorem, and automatic sequences. His work is accessible through his personal page and MathSciNet.
Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.
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.
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.
Patrick Allen is an Associate Professor in the Department of Mathematics and Statistics at McGill University, where he contributes to research in number theory and related fields. He is affiliated with the Montreal Number Theory Group and the Centre Interuniversitaire en Calcul Mathématique Algébrique (CICMA), focusing on areas such as Galois representations, automorphic forms, and algebraic number theory. His work bridges algebraic geometry and arithmetic, with a particular emphasis on modularity lifting theorems and deformation theory. Allen's research interests include the study of CM fields, modular forms, and elliptic curves, alongside investigations into the Langlands program and p-adic methods. He has published extensively on topics such as potential automorphy, monodromy, and adjoint Selmer groups. His contributions address questions in arithmetic algebraic geometry and cohomological automorphic forms, often intersecting with representation theory. While his articles span over 20 years, recent work (2020–2023) emphasizes the modularity of Galois representations over CM fields and the application of automorphic techniques to solve problems in number theory. Allen’s research often involves collaboration with international experts in algebraic number theory and arithmetic geometry. Scientific Awards: None explicitly listed in the provided materials. Advising & Grants: No formal advisees or grant details are listed in the text. His affiliations with CICMA suggest participation in collaborative research initiatives, though specific grants are not mentioned. Labs/Teams: Active member of the Montreal Number Theory Group and CICMA, contributing to inter-university collaborative projects in algebraic number theory.
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.
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.
Joachim Rosenthal is a Professor of Applied Mathematics at the University of Zurich's Department of Mathematics, leading the Applied Algebra Group. His research integrates coding theory, cryptography, and algebraic geometry with applications in communications and security systems. His primary research explores algebraic coding theory including convolutional codes, subspace codes, and post-quantum cryptography. He develops algorithms for error correction, code optimization, and cryptographic protocol analysis, with emphasis on mathematical structures in finite fields and rings. Professor Rosenthal serves as President of the Swiss Mathematical Society (2024-2025) and sits on IEEE Information Theory Society's Board of Governors. He has organized multiple international conferences on coding theory and cryptography, including the Zurich COST Meeting and Workshop on Convolutional Codes. His editorial contributions include roles at Archiv der Mathematik and SIAM Journal on Applied Algebra and Geometry. Recent publications focus on code construction methods, complexity analysis in group-based cryptography, and algebraic approaches to error-correcting codes.
Chan Song Heng is an Associate Professor in the Division of Mathematical Sciences at the School of Physical and Mathematical Sciences, Nanyang Technological University (NTU), Singapore. He has been affiliated with NTU since 2007. His academic journey includes a B.Sc. (Hons) in Mathematics from the National University of Singapore (2001) and a Ph.D. in Mathematics from the University of Illinois at Urbana-Champaign (2005). His research focuses on advanced mathematical topics such as partition theory, q-series, mock theta functions, and number theory. Recent work includes studies on identities analogous to Jacobi, Fermat-Wilson theorems, and applications of Rogers-Fine identities. His publications explore combinatorial, analytic, and algebraic aspects of these fields, with notable contributions to modular forms, theta functions, and partition congruences. Dr. Chan’s articles often intersect with classical problems in mathematics, blending historical insights with modern analytical techniques. Notable themes include exploring identities through modular forms, analyzing partition statistics (ranks/cranks), and studying mock theta functions. Despite his prolific output, no specific scientific awards or student advisees are listed in the provided materials.
Frank Calegari is a Professor of Mathematics at the University of Chicago. His primary research interests include algebraic number theory, the Langlands program, Galois representations, and arithmetic geometry. He has made significant contributions to understanding reciprocity laws linking Galois representations to automorphic forms. His work often intersects with cohomology of arithmetic groups, motives, and the arithmetic of periods. Prof. Calegari has advised numerous PhD students, including Maria Stadnik, Shiva Chidambaram, and Eric Stubley. He serves on editorial boards for prestigious journals such as Algebra & Number Theory, Essential Number Theory, and the Annals of Mathematics. He actively participates in academic conferences and programs, including organizing the 2020 Arithmetic of the Langlands Program in Bonn. His research spans modularity theorems for abelian varieties, cohomology of arithmetic groups, and the study of L-functions. Key recent work includes resolving the unbounded denominators conjecture and advancing potential automorphy results over CM fields. Calegari frequently collaborates with leading mathematicians, including George Boxer, Vincent Pilloni, and Yilin Yang. He teaches advanced courses such as Honors Calculus (Math 16100) at the University of Chicago. His expository work includes lecture notes on motives and L-functions, as well as a blog compiling mathematical insights (Persiflage). Calegari’s contributions to number theory have been recognized through his editorial roles and invited lectures at institutions like the ICM and Clay Mathematics Institute.
Christophe VIGNAT is a Professor at CentraleSupélec, affiliated with the Laboratoire des Signaux et Systèmes (L2S). His research focuses on number theory, special functions, probability, and their applications in signal processing and control systems. He has held visiting professorships at École Polytechnique Fédérale de Lausanne (EPFL) and Tulane University. VIGNAT's work bridges pure mathematics and applied fields, with notable contributions to Bernoulli/Euler polynomials, multiple zeta values, and probabilistic methods in number theory. His recent publications explore topics like partition functions, theta functions, and Ramanujan-type identities. He has delivered talks at international conferences and collaborates widely with researchers in mathematics and physics. Research Interests: Number theory, special functions (Bessel, orthogonal polynomials), probability theory, signal processing, control systems, analytic combinatorics, and their interconnections. His work often employs symbolic computation and probabilistic approaches to uncover identities and structures in mathematical analysis. Publications Trends: Recent articles emphasize partition theory, zeta functions, and integrals related to classical polynomials. His collaborations highlight interdisciplinary efforts between pure mathematics and applied sciences. Over 150 refereed papers and conference contributions demonstrate his prolific output across diverse mathematical domains. Education: While specific academic history isn’t detailed, his roles and publications suggest advanced training in mathematics and engineering, typical for a full professor in systems and control.
Prof. Dr. Gerold Alsmeyer is a faculty member at the Institute of Mathematical Stochastics, Department of Mathematics and Computer Science, University of Münster. He is an active researcher with a focus on stochastic processes, particularly stochastic fixed-point equations and iterated function systems. His work is supported by his role as an Investigator in Mathematics Münster in the project EXC 2044 - C1: Evolution and asymptotics. His primary research interests include the theory of stochastic processes, branching processes, Markov random walks, renewal theory, and the asymptotic analysis of random structures such as random trees and polytopes. He has made significant contributions to the understanding of fluctuation theory, perpetuities, and the smoothing transform. His recent publications (2017–2023) reveal a sustained focus on theoretical probability, with recurring themes in random difference equations, iterated function systems, and limit theorems for stochastic processes. The work spans pure mathematical theory and applications in mathematical biology and combinatorics, indicating a broad yet deep research profile. Prof. Alsmeyer has supervised numerous doctoral and master’s students, including Viet Hung Hoang, Christopher Eick, Philipp Godland, and Fabian Buckmann, whose dissertations cover topics in branching processes, random walks, and stochastic fixed-point equations. He has no listed scientific awards in the provided texts. He teaches courses in probability theory, mathematical statistics, branching processes, and stochastic recursion equations, demonstrating a strong commitment to academic mentoring and education.
