Jared Duker Lichtman is a Szegö Assistant Professor at Stanford University's Department of Mathematics, beginning in the 2024-25 academic year. Previously, he served as an NSF Postdoctoral Fellow at Stanford under Prof. Kannan Soundararajan. He completed his PhD at the University of Oxford in 2023, focusing on multiplicative number theory. His research centers on prime number distribution, multiplicative structures, and analytic number theory. Notably, he established a world record in studying primes' distribution within arithmetic progressions. His work bridges classical number theory with modern techniques like sieve methods and L-function analysis. Jared's publications explore topics such as the abc conjecture, twin primes, and Erdős problems. While no formal awards are listed, his groundbreaking contributions to prime distribution and multiplicative number theory mark him as a rising star in the field. His academic trajectory includes a focus on primes in arithmetic progressions, Goldbach conjecture extensions, and probabilistic number theory applications. Ongoing research likely continues this trajectory, with potential implications for cryptography and additive number theory.
Kevin Ford 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 Number Theory, including prime number theory, divisor theory, probabilistic methods, and sieve theory, with notable contributions to the Riemann zeta function and divisor distribution. Ford is also an editor for Research in Number Theory and the Bulletin and Journal of the London Mathematical Society . His recent work explores topics such as large gaps between primes, composite polynomial values, and the concentration of divisors. Ford’s publications often bridge analytic and probabilistic techniques to address classical number-theoretic problems. Despite extensive contributions, no specific academic awards are explicitly listed, though his editorial roles highlight his influence in the field. He advises no listed students, though his research group and collaborations with leading mathematicians like Terence Tao and Dimitris Koukoulopoulos are evident in his publications. Ford’s academic presence includes organizing the Illinois Number Theory Seminar and maintaining an active research agenda in number theory and combinatorics.
Noga Alon is a Professor of Mathematics at Princeton University, affiliated with the Mathematics Department. He is renowned for his contributions to Combinatorics, Graph Theory, and Theoretical Computer Science. His research emphasizes algebraic and probabilistic methods, with applications in circuit complexity and combinatorial geometry. Education & Affiliations Current position: Professor at Princeton University. Active in the Princeton Discrete Mathematics Seminar and has led conferences like the Noga60 Birthday Conference. Research Interests Focus areas include Combinatorics (e.g., Ramsey Theory, Graph Coloring), Theoretical Computer Science (e.g., Algorithms, Complexity), and probabilistic and algebraic methods in discrete mathematics. His work bridges combinatorial structures and algorithmic applications, with contributions to expander graphs, randomized algorithms, and extremal graph theory. Publications Over 300 papers, including foundational work on the probabilistic method, expander graphs, and combinatorial algorithms. Notable recent topics include graph coloring, path-finding algorithms (e.g., Color-coding), and spectral techniques for graph problems. Grants & Awards No specific grants or awards listed in available texts, though his academic stature implies prestigious recognition in combinatorics and computer science. Labs & Collaborations Involved in collaborative research through Princeton’s Mathematics Department and international conferences. Leads seminars and co-authors work with prominent researchers like M. Naor, J. Spencer, and others.
Shachar Lovett is a researcher at the University of California, San Diego (UCSD), specializing in computational complexity, combinatorics, and theoretical computer science. His work spans advanced topics in communication complexity, pseudorandomness, and coding theory, often intersecting with problems in additive combinatorics and Boolean function analysis. Education : Not explicitly detailed in the provided text. Research Interests : Lovett's research focuses on computational complexity, particularly in communication and circuit complexity, combinatorial structures like sunflowers and high-dimensional expanders, and the analysis of Boolean functions through Fourier and Gowers norms. His work explores the limits of deterministic vs. randomized computation, the structure of codes over finite fields, and the interplay between additive combinatorics and theoretical computer science. Article Trends : His recent publications address exact vs. approximate representations of Boolean functions, quasipolynomial bounds in combinatorics, hypercontractivity in high-dimensional expanders, and advancements in the log-rank conjecture. These works emphasize connections between computational complexity, discrete mathematics, and pseudorandomness, often yielding improved bounds or novel frameworks for understanding Boolean function behavior. Scientific Awards : No specific awards or honors were mentioned in the provided text. Advising and Collaborations : Lovett collaborates extensively with researchers like Hamed Hatami, Kaave Hosseini, and Jiapeng Zhang, contributing to fields such as non-malleable codes, matrix multiplication algorithms, and communication complexity. No formal student advising details were provided.
Scott A. Huettel is a Professor in the Department of Psychology and Neuroscience at Duke University, where he also serves as Senior Associate Dean for Research in Trinity College of Arts & Sciences. He holds additional appointments as Professor of Neurobiology and Professor in Psychiatry and Behavioral Sciences. As a Bass Fellow, Huettel leads research in decision neuroscience and neuroeconomics, with affiliations spanning multiple Duke research centers including the Center for Brain Imaging and Analysis, Duke Institute for Brain Sciences, and Center for Cognitive Neuroscience. Huettel's research focuses on the brain mechanisms underlying economic and social decision making. His laboratory uses fMRI to probe brain function, behavioral assays to characterize individual differences, and various physiological methods including eye tracking, pharmacological manipulation, and genetics to link brain and behavior. His work has advanced new analysis methods for fMRI data, including functional connectivity analyses, pattern classification, and combinatoric multivariate approaches. His research spans applications in behavioral economics, consumer decision making, and neuroethics. Huettel's recent publications demonstrate a strong focus on social decision making, risk assessment, and the neural mechanisms of economic choices. His work increasingly integrates computational approaches with traditional neuroimaging to better understand how people process information during decision making. His research has significant implications for understanding financial behavior, health decisions, and social interactions across the lifespan. Education in Neuroimaging Award from the Organization for Human Brain Mapping (2021) 2014 Innovation Award from the Social and Affective Neuroscience Society (2013) Bass Fellow for Excellence in Research and Teaching (2012) Jerry G. and Patricia Crawford Hubbard Professorship at Duke University (2012) Top 5% undergraduate instructor in Arts & Sciences at Duke (2010) Dean's Award for Excellence in Mentoring from Duke University Graduate School (2010) Huettel actively mentors students and has trained numerous postdoctoral and graduate researchers who now lead their own laboratories. He is lead author of the textbook Functional Magnetic Resonance Imaging (3rd edition, 2014) and teaches courses including Fundamentals of Decision Science, Decision Neuroscience, and Neuroethics. His research is supported by multiple grants from NIH and other funding agencies, focusing on mechanisms of social behavior, aging, and neuroimaging technology development. Huettel directs a productive research laboratory that integrates multiple methodologies to investigate decision processes. His team combines fMRI, eye tracking, behavioral testing, and computational modeling to examine how people make economic and social choices. The lab has made significant contributions to understanding how attention, risk, and social context influence decision making across different populations including adolescents, older adults, and clinical populations.
Tamar Ziegler is a Professor of Mathematics at the Einstein Institute of Mathematics, Hebrew University, holding the Henry and Manya Noskwith Chair in Mathematics since 2018. She currently serves as Chair of the Einstein Institute (2020-present) and has held visiting positions at prestigious institutions including IAS Princeton (2022-2023 Distinguished Visiting Professor), MSRI (2017 Simons Professor), and Stanford University (2012-2013). Her academic journey began with a B.Sc. summa cum laude (1995), M.Sc. (1998), and Ph.D. (2003) in mathematics from Hebrew University under advisor Hillel Furstenberg. Her career progression shows steady advancement from Zassenhaus Assistant Professor at Ohio State University (2002-2005), through positions at Technion (rising from Senior Lecturer to Professor), to her current role at Hebrew University since 2013. Ziegler's research spans number theory, ergodic theory, and combinatorics, with particular focus on additive combinatorics, higher order Fourier analysis, and connections between dynamical systems and number theory. Her work frequently involves collaborations with leading mathematicians including Terence Tao, Ben Green, and David Kazhdan. Analysis of her publication record reveals consistent contributions to fundamental mathematical problems, particularly in establishing polynomial patterns in primes, inverse conjectures for Gowers norms, and connections between ergodic theory and combinatorial number theory. Her research demonstrates a progression from foundational work on characteristic factors to increasingly sophisticated applications in prime number theory. 2025-2030 ERC Advanced grant 2024 Rothschild Prize in Mathematics 2024 9th European Congress in Mathematics, Plenary Speaker 2023 AIM Alexanderson Award 2021 Elected to Academia Europaea 2016 Rector's Prize for Excellence in Research and Teaching 2016-2021 ERC Consolidator grant 2015 Michael Bruno Memorial Award Ziegler has received continuous research funding through prestigious grants including multiple ERC awards and fellowships. Her leadership role as Chair of the Einstein Institute demonstrates significant institutional responsibility. While specific advising information isn't provided in the sources, her Erdős number is 2 (via Hillel Furstenberg) and she has collaborated with many prominent mathematicians throughout her career. As Chair of the Einstein Institute of Mathematics, Ziegler leads one of Israel's premier mathematical research centers, overseeing research programs and academic activities that connect ergodic theory, number theory, and combinatorics with other mathematical disciplines.
Davi De Castro Silva is a Researcher at the University of Cambridge, affiliated with the Department of Computer Science and Technology and the Centre for Quantum Information and Foundations. His current work is advised by Tom Gur and Sergii Strelchuk. Previously, he was a postdoc at CWI (Amsterdam) in QuSoft, advised by Jop Briët, and completed his PhD in Applied Mathematics at the University of Cologne under Frank Vallentin and Fernando de Oliveira Filho. He holds a Master's from IMPA (Brazil) under Roberto Imbuzeiro Oliveira and a BSc/MSc from École Polytechnique (France). His research focuses on theoretical computer science, quantum computing, and combinatorics, with recent emphasis on quantum speedups' structural foundations, such as symmetry's role. Key areas include additive combinatorics (e.g., higher-order Fourier analysis), computational complexity (lower bounds), combinatorial optimization (semidefinite programming), and quantum information theory. Notable contributions include studies on quasirandomness in additive groups, quantum algorithms' limitations, and tensor analysis. His work bridges combinatorial methods with quantum computing, exploring algorithmic efficiency and structural properties. He has published in journals like Discrete Analysis , Combinatorica , and Forum of Mathematics, Sigma , with preprints addressing quantum computation symmetry, Goldreich-Levin algorithms, and hypergraph quasirandomness. His research highlights interdisciplinary approaches to foundational questions in computing and mathematics.
Julia Wolf is a Professor of Pure Mathematics at the University of Cambridge, affiliated with the Department of Pure Mathematics and Mathematical Statistics (DPMMS) and Trinity College. Her research focuses on arithmetic combinatorics, harmonic analysis, and analytic number theory, with interdisciplinary connections to model theory, discrete geometry, and theoretical computer science. She holds an EPSRC Open Fellowship and has organized events like the Warwick-Oxbridge-Manchester-Bristol-London (WOMBL) meetings. Wolf teaches advanced courses such as 'Higher-Order Uniformity' and 'Analytic Number Theory,' emphasizing structure and applications. Her work bridges combinatorial, analytic, and algebraic techniques, addressing problems like polynomial configurations in primes, extremal hypergraph theory, and Ramsey multiplicity. Recent research includes structural stability in finite abelian groups and applications of model theory to additive combinatorics. Wolf actively promotes open-access publishing and has mentored numerous postdoctoral researchers and students through initiatives like the Philippa Fawcett Internship Programme. She also contributes to academic equity efforts, such as gender-inclusive hiring in mathematics. Professional activities include editorial roles, conference organization (e.g., the Simons Institute's Pseudorandomness program), and leadership in collaborative projects like the 'Combinatorics Meets Model Theory' workshop. Her grants and fellowships underscore her contributions to advancing discrete mathematics and fostering international academic networks.
Lisa Sauermann is a Professor at the University of Bonn's Institute of Applied Mathematics, specializing in extremal and probabilistic combinatorics. She holds affiliations with the Institute of Mathematics and has been recognized with prestigious awards including the Richard-Rado Prize (2020), European Prize in Combinatorics (2021), and von Kaven Award (2023). PhD from Stanford University (2019), supervised by Jacob Fox Postdoc at Stanford University and Institute for Advanced Study (IAS), Princeton Assistant Professor at MIT (2021-2023) Her research focuses on additive combinatorics, discrete geometry, and polynomial methods, particularly the slice rank polynomial method. This technique was instrumental in deriving new bounds for three-term progression-free sets in F_pⁿ and solving problems like the Erdős-Ginzburg-Ziv conjecture in high dimensions. Her work bridges theoretical combinatorics with applications in finite field geometry and extremal set theory. The four lectures she presented at Collège de France in 2025 highlight her innovative use of the slice rank polynomial method to tackle longstanding problems in additive combinatorics, including three-term progression-free subsets and zero-sum configurations. Richard-Rado Prize (2020) European Prize in Combinatorics (2021) von Kaven Award (2023) Gauß Lectures (2024) Cours Peccot International laureate (2024-2025) Lisa Sauermann's career spans institutions like Stanford, MIT, and the IAS, with current leadership in advancing combinatorial methodologies at the University of Bonn. Her work continues to influence both theoretical and applied mathematical domains.
Irit Dinur is a professor at the Weizmann Institute of Science , specializing in theoretical computer science and combinatorics. She works in the Department of Applied Mathematics and Computer Science, focusing on probabilistically checkable proofs (PCPs), hardness of approximation, and high-dimensional expanders (HDX). Organizer of the Winter School on Expansion in Groups, Combinatorics, and Complexity (2025) at Weizmann Institute Co-organizer of the ICTS Workshop on HDX and Codes (Bangalore, April 2025) Teaching a summer course on Robust Computation: From Local to Global (2025) Her research bridges theoretical computer science and mathematics, with recent work exploring: Interactive proof systems and their applications to undecidability Connections between high-dimensional expanders and quantum LDPC codes Advances in PCP theory and their implications for computational complexity Sparse graph counting techniques in additive combinatorics She has been instrumental in organizing educational initiatives that explore cutting-edge topics like: Expansion properties in Cayley graphs Coboundary expansion in coset complexes Applications of finite free probability to expander graphs
Emmanuel Breuillard is a Professor of Pure Mathematics at the University of Oxford. Previously, he held positions as Sadleirian Professor at the University of Cambridge (2017-2021), Professor at Université Paris-Sud (2008-2017), and Associate Hadamard Professor at École Polytechnique (2006-2008). His academic journey includes a PhD from Université Paris-Sud and Yale University, supervised by Frédéric Paulin and Gregory Margulis, and a Master in Mathematics from Cambridge. PhD: Université Paris-Sud (2004), supervised by Frédéric Paulin; Yale University, supervised by Gregory Margulis Master: University of Cambridge (2000) Ecole Normale Superieure (1997-1999) His research spans Combinatorics , Geometric Group Theory , Ergodic Theory , and Number Theory , focusing on approximate groups, expansion in finite simple groups, and Diophantine geometry. His recent work analyzes Elekes-Szabo problems in projective geometries. He has authored 50+ publications in prestigious journals, addressing topics like random polynomials, C*-simplicity, and uniform independence in linear groups. Fellow of the Royal Society (2024) ERC Consolidator Grant (2014-2019) Prix Charles-Louis de Freycinet (2013) European Mathematical Society Prize (2012) ERC Starting Grant (2008-2013) Cours Péccot, Collège de France (2006)
Joni Teräväinen is an Assistant Professor at the University of Cambridge , affiliated with the Department of Pure Mathematics and Mathematical Statistics. His research is funded by an ERC Starting Grant and has been supported by prestigious fellowships including the Academy Research Fellow, Marie Curie Fellow, and von Neumann Fellow. Current Role: Assistant Professor, University of Cambridge Previous Roles: Academy Research Fellow (University of Turku), von Neumann Fellow (IAS), Titchmarsh Research Fellow (University of Oxford) His research interests lie at the intersection of analytic number theory , additive combinatorics , and ergodic theory , with a focus on multiplicative functions, prime distribution, and higher-order Fourier analysis. Recent work explores correlations of multiplicative functions, Fourier uniformity in short intervals, and applications to the Chowla and Elliott conjectures. Joni has published extensively in top journals including the Journal of the European Mathematical Society , Annals of Mathematics , and Proceedings of the London Mathematical Society . His publications reveal a trend toward quantitative bounds for Gowers uniformity, shifted exponential composites, and function field analogues of classical problems. Scientific Awards: ERC Starting Grant Academy Research Fellow Marie Curie Fellow von Neumann Fellow Academy of Finland Postdoctoral Researcher Titchmarsh Research Fellow Contact: jt945@cam.ac.uk . More details are available on his personal homepage .
Peter Nelson is an Associate Professor in the Department of Combinatorics and Optimization at the University of Waterloo, Canada. He currently serves as the Associate Chair for Undergraduate Studies, coordinating academic advising and managing departmental operations. His research focuses on structural and extremal matroid theory, graph theory, and their connections to coding theory, additive combinatorics, and finite geometry. He holds an NSERC Discovery Grant and has contributed to foundational work on matroid minors, binary matroid classification, and combinatorial enumeration. His recent interests include formalizing proofs in the LEAN theorem prover. Education: Ph.D. in Mathematics (University of Waterloo, 2008) with a thesis titled *Exponentially dense matroids*. His academic journey includes postdoctoral research and teaching roles prior to his current position. Research Interests: Structural matroid theory (e.g., minor-closed classes, forbidden configurations) Binary matroid extremal problems Applications to coding theory and additive combinatorics Formal proof systems like LEAN Advising & Grants: As Associate Chair, he oversees undergraduate academic advising via coundergrad.officer@uwaterloo.ca . His NSERC grant supports investigations into matroid density and extremal configurations. He has collaborated extensively with institutions globally, including co-authoring over 40 peer-reviewed publications. Labs/Teams: Active member of the Combinatorics and Optimization research group at Waterloo, contributing to collaborative projects on matroid theory and discrete mathematics.
Faiz Hamid serves as an Associate Professor in the Department of Management Sciences at Indian Institute of Technology Kanpur. With a Ph.D. in Decision Sciences & Information Systems from IIM Lucknow (2012) and a B.Tech. in Computer Science and Engineering from Institute of Engineering & Management (2007), he brings strong technical and analytical expertise to his academic position. His research interests span Operations Research, Combinatorial Optimization, Network Optimization, and Data Science, with particular focus on transportation systems, pandemic response modeling, and revenue management applications. Dr. Hamid's scholarly work demonstrates consistent publication in high-impact journals including European Journal of Operational Research, Omega, Transportation Research, and IEEE Transactions on Signal Processing. His recent publications reveal a strong trend toward applying optimization techniques to real-world problems, particularly addressing pandemic-related challenges in transportation systems and developing sophisticated mathematical models for railway operations. His 2024 edited volume 'Optimization Essentials: Theory, Tools, and Applications' demonstrates his leadership in the field. Ph.D. Thesis recognized as runner-up for 2014 Best Dissertation Award by The INFORMS Technical Section in Telecommunications Best Paper Award at COSMAR 2010 Doctoral Conference, Indian Institute of Science, Bangalore Professor Dipak C Jain Best Paper Award at IMR Doctoral Conference 2010, IIM Bangalore Silver Medal, National Mathematics Olympiad 2002 Dr. Hamid has advised numerous students and collaborated extensively with researchers globally, particularly in transportation optimization problems. His professional journey includes industry experience as Associate Functional Architect at JDA Software and post-doctoral research at Telecom SudParis, France, before joining IIT Kanpur's faculty.
Mehtaab Sawhney is a Clay Research Fellow and a tenure-track assistant professor at Columbia University specializing in combinatorics, probability, analytic number theory, and theoretical computer science. His academic journey began at the University of Pennsylvania where he enrolled in a Bachelor of Engineering in Computer Science (2016-2017), then continued at MIT where he earned a Bachelor of Science in Mathematics with Minor in Computer Science (2017-2020), followed by a Doctor of Philosophy in Mathematics (2020-2024) under the advisorship of Yufei Zhao. His research spans probabilistic combinatorics, random matrix theory, additive number theory, and theoretical computer science. Sawhney's work bridges theoretical mathematics with computational applications, focusing on random structures, additive combinatorics, and spectral properties of discrete objects. His publications demonstrate a strong interdisciplinary approach that connects number theory with probabilistic methods to solve complex combinatorial problems. The analysis of his publication record reveals a consistent focus on foundational mathematical structures with applications across multiple domains. His work on random graphs, additive bases, and arithmetic progressions has established him as a leading researcher in modern combinatorics, often collaborating with prominent mathematicians including Ashwin Sah, Yufei Zhao, and Vishesh Jain. His research output shows remarkable depth and breadth, with contributions to both pure mathematics and theoretical computer science. 2024 Clay Research Fellow 2021 Frank and Brennie Morgan Prize for Outstanding Research in Mathematics by an Undergraduate Student (joint with Ashwin Sah) Churchill Scholar 2020 Best Student Paper STOC 2021 (Joint with Ryan Alweiss, Yang Liu) Best Student Paper ITCS 2022 (Joint with Yang Liu, Ashwin Sah) 2023 Hartley Rogers Jr. Prize 2022 Charles W. and Jennifer C. Johnson Prize (joint with Ashwin Sah) NSF Graduate Fellowship Sawhney has established a robust research program with significant contributions across multiple mathematical disciplines. His frequent collaborations with top researchers worldwide indicate an active and influential research network. While specific advisees aren't listed in available information, his extensive publication record with numerous co-authors suggests active mentorship of junior researchers through collaborative projects.
