Find Academic Supervisors

Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +3 more

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
• +3 more

Donald Robertson is a Lecturer in Pure Mathematics at the University of Manchester, specializing in ergodic theory with applications to additive combinatorics. His work connects measurable dynamics with combinatorial number theory problems. Research explores ergodic properties of interval exchange transformations, sumset configurations in infinite sets, and equidistribution in homogeneous dynamics. Recent publications address Erdős' sumset conjecture (2022), saddle connection distributions (2023), and disjointness in measurable group actions. He teaches measure theory and ergodic theory courses, employing problem-based learning through weekly take-home tests. Coursework emphasizes Lebesgue integration, ergodic theorems, and connections between dynamics and combinatorics.

• Ergodic Theory
• Additive Combinatorics
• Interval Exchange Transformations
• +1 more

Professor Adam Harper specializes in analytic and probabilistic number theory at the University of Warwick. His research examines moments of random multiplicative functions, distribution of zeta sums, and extreme values in number theory. Teaches MA4L6 (Analytic Number Theory) and MA257 (Introduction to Number Theory). Recent publications (2019-2024) address Halász's theorem, Fyodorov-Keating conjectures, and character sum distributions. Research bridges combinatorics, probability, and statistical mechanics, with focus on multiplicative chaos and Gaussian processes.

• Analytic Number Theory
• Probabilistic Number Theory
• Random Multiplicative Functions
• +2 more

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.

• Arithmetic Combinatorics
• Harmonic Analysis
• Analytic Number Theory
• +3 more

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.

• Theoretical Computer Science
• Quantum Computing
• Combinatorics
• +5 more

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 .

• Analytic Number Theory
• Additive Combinatorics
• Ergodic Theory
• +3 more

Dr. Robin Stephenson is a Lecturer at the School of Mathematical and Physical Sciences, University of Sheffield. His research focuses on Probability Theory, Stochastic Processes, and Applied Probability, with a particular emphasis on random trees, fragmentation processes, and Markov additive processes. His publications span topics like scaling limits of random graphs, self-similar fragmentation, and bivariate Markov chain convergence. He teaches the Probability Modelling module (MAS275) and is based in the Hicks Building (I18), Sheffield, S3 7RH, UK. His work reveals trends in theoretical probability, including critical Galton-Watson trees, directed graph scaling, and the analysis of Markov additive processes. Research applications extend to random maps and self-similar fragmentation dynamics.

• Probability Theory
• Stochastic Processes
• Applied Probability
• +2 more

Dr. John Haslegrave is a Lecturer in Probability at Lancaster University's School of Mathematical Sciences, where he is an active member of both the Probability and Combinatorics research groups. Previously, he held positions at the University of Oxford (working with Peter Keevash), University of Warwick (with Agelos Georgakopoulos), and University of Sheffield (with Hong Liu and Chris Cannings). He completed his PhD at Trinity College, Cambridge under Béla Bollobás. His research focuses on: Random graphs and evolving network models (especially preferential attachment) Interacting particle systems and random walks on graphs Extremal problems in graph/hypergraph theory Percolation theory and geometric probability Combinatorial optimization and graph invariants Analysis of recent publications reveals strong emphasis on probabilistic combinatorics, with frequent exploration of: structural graph properties, asymptotic behavior of stochastic processes, geometric embeddings, and optimization problems. His work consistently bridges discrete mathematics with statistical physics concepts. Dr. Haslegrave welcomes PhD students interested in discrete probability and graph theory, with current supervision interests including preferential attachment models, interacting particle systems, planar percolation, and extremal problems. He teaches undergraduate courses in Graph Theory (MATH326) and Probability (MATH103), and organizes Lancaster's Pure Mathematics Seminar series.

• Random Graphs
• Preferential Attachment
• Interacting Random Walks
• +4 more

Dr. Maria Ivan is a Lecturer in the Department of Pure Mathematics and Mathematical Statistics at the University of Cambridge and holds a Fellowship at Magdalene College. Her primary academic appointment involves research and teaching in advanced mathematical disciplines. Her research focuses on several interconnected areas of combinatorics: Extremal Combinatorics : Investigating maximum/minimum possible sizes of mathematical structures Ramsey Theory : Studying conditions under which order must appear in mathematical systems Poset Saturation : Examining partially ordered sets that are maximally dense without containing certain substructures Analysis of her 15 most recent publications (2020-2025) reveals consistent focus on combinatorial structures including poset saturation problems, Turán densities for hypercubes and daisies, Ramsey-theoretic characterizations, and extremal set theory. Her work frequently involves establishing new bounds, solving open conjectures, and developing novel proof techniques within discrete mathematics. No scientific awards, grants, or student advising relationships are documented in the available information.

• Extremal Combinatorics
• Ramsey Theory
• Poset Saturation

Dr. Minmin Wang is an Associate Professor in the Department of Mathematics at the University of Sussex, joining in 2019. Her research focuses on probability theory, including combinatorial probability, random graphs, branching processes, and scaling limits. She holds a PhD from Sorbonne University (formerly Paris 6), an MSc from École Polytechnique, and a BSc from Tsinghua University. Her work has been supported by an EPSRC New Investigator Grant (2023–2025). Notable achievements include the Itô Prize (2025) for her paper on stable trees. She serves on the editorial board of the Applied Probability Trust and the committee of the Royal Statistical Society's Applied Probability Section. Education: PhD in Probability, Sorbonne University (2014) MSc/Diplôme d'ingénieur, École Polytechnique, France BSc in Mathematics, Tsinghua University, China Research Interests: Combinatorial probability, random trees and graphs, scaling limits, fragmentation, coalescence, self-similar Markov processes, and superprocesses. Her recent work explores critical window phenomena in random intersection graphs and stochastic models in neutron transport. Grants & Awards: EPSRC Grant 'Stochastic processes on random graphs with clustering' (2023–2025) Itô Prize (2025) for 'Stable trees as mixings of inhomogeneous continuum random trees' Teaching & Supervision: Teaches courses like 'Linear Statistical Models' and 'Fundamentals of Mathematics'. Advises PhD student Félix Kahane and postdoc Alastair Haig. Supervised projects on Monte-Carlo methods and election forecasting. Research Group: Hosts a team exploring stochastic processes and random graph dynamics, with ongoing collaborations on neutron transport simulations and combinatorial tree structures.

• Probability Theory
• Combinatorial Probability
• Random Graphs
• +6 more

Dr Jonathan Chapman is a Research Fellow at the Department of Mathematics, University of Warwick. His research focuses on additive combinatorics, Ramsey theory, and number theory, with particular emphasis on partition regularity, Diophantine equations, and combinatorial structures in number systems. His work bridges algebraic, analytic, and probabilistic methods to address problems in arithmetic Ramsey theory and additive patterns. Recent publications explore topics such as monochromatic solutions to multiplicative equations, additive Ramsey configurations over primes and non-integer sequences, and generalizations of classical Ramsey criteria like Rado and Roth theorems. His studies often involve intricate interplays between linear algebraic structures, syndetic sets, and hypergraph Ramsey phenomena. No scientific awards or grants are explicitly listed in available records. He currently holds no documented advisees, though his research likely involves collaboration with graduate students and postdocs in the Mathematics Institute. His affiliations include the Mathematics Institute at the University of Warwick, with office B2.28 and contact details available via institutional channels.

• Additive Combinatorics
• Number Theory
• Ramsey Theory
• +3 more

Chelsea Edmonds is a Researcher in the Department of Computer Science at the University of Sheffield, working on the COVERT project focusing on formal verification and security. She completed her PhD at the University of Cambridge under Prof. Larry Paulson, formalising combinatorial structures in Isabelle/HOL. Previously, she was a Software Engineer at Boeing Australia and holds a dual degree from the University of Queensland. Education: PhD in Computer Science (University of Cambridge), 2024 Bachelor of Engineering (Software) & Bachelor of Science (Mathematics), University of Queensland, 2017 (First Class Honours, University Medal) Research Interests: Formal methods, proof assistants, combinatorial mathematics formalisation, security verification, and HCI aspects of theorem proving tools. Key contributions include probabilistic combinatorial formalisation and modular library design in Isabelle/HOL. Publications: Over 10 peer-reviewed papers, including work on the Lovász Local Lemma, Balog-Szemerédi-Gowers theorem, and Fisher’s inequality formalisation. Her research bridges theoretical mathematics and applied verification. Awards: Cambridge Australia Scholarship, British Federation of Women Graduates Academic Award, Distinguished Paper at CPP 2024. Active in outreach, including leadership roles in Women@CL and Robogals.

• Formal Methods
• Proof Assistants (Isabelle/HOL)
• Combinatorics
• +3 more

Dr. Marius Tiba is a Lecturer in Pure Mathematics at King's College London, part of the Analysis group within the Department of Mathematics. His academic journey includes a PhD from the University of Cambridge (2021, supervised by Béla Bollobás), a postdoctoral position at IMPA (Rio de Janeiro), and a Titchmarsh Research Fellowship at the University of Oxford (2022–2024). His research focuses on geometric problems rooted in analysis, probability, and combinatorics, with a special emphasis on stability of geometric inequalities, covering systems, Ramsey theory, and Littlewood polynomials. He holds a BA and Master of Mathematics from Trinity Hall, University of Cambridge. His teaching includes lecturing on Complex Analysis and supervising dissertations on Stability of Geometric Inequalities and Ramsey theory. He currently co-supervises PhD student Albert Rehak at KCL and Zhaoyang Liu at the London School of Geometry and Number Theory. His research outputs include groundbreaking work on geometric inequalities (e.g., Brunn-Minkowski stability), multicolour Ramsey numbers, and the existence of flat Littlewood polynomials. He collaborates extensively with leading mathematicians like Alessio Figalli and Robert Morris. His work bridges pure mathematics fields, often applying probabilistic and combinatorial techniques to geometric problems. Key research themes include quantitative stability estimates for functional inequalities, extremal combinatorics, and additive number theory. His contributions have appeared in top journals like the Annals of Mathematics, Journal of the European Mathematical Society, and Inventiones Mathematicae.

• Geometric Inequalities
• Probability
• Combinatorics
• +5 more

Professor Tim Gowers is a Professor of Mathematics at the University of Cambridge, affiliated with the Department of Pure Mathematics and Mathematical Statistics (DPMMS) within the Faculty of Mathematics. He is actively involved in the Cantab Capital Institute for the Mathematics of Information and the Combinatorics research group, contributing to Cambridge's renowned mathematical community. Professor Gowers' primary research focuses on Analysis and Combinatorics, with significant contributions to additive combinatorics, harmonic analysis, and their intersections with number theory and algebraic structures. His work demonstrates deep connections between discrete mathematics and analytic methods, often revealing fundamental structures in seemingly complex problems. His recent publications (2020-2025) show a continued emphasis on combinatorial problems in additive number theory and group theory, while also expanding into interdisciplinary research at the mathematics-AI interface, particularly in evaluating language models for mathematical reasoning and developing tools for formal verification. Professor Gowers maintains an active research program with numerous collaborations with leading mathematicians including Ben Green, Terence Tao, and Julia Wolf, publishing in top-tier journals such as the Annals of Mathematics and Geometric and Functional Analysis. Based in room C2.04 at DPMMS, he continues to contribute significantly to mathematical research and education at Cambridge, with his work influencing both theoretical developments and practical applications in computational mathematics.

• Analysis
• Combinatorics
• Additive Combinatorics
• +2 more