or
Continue with FacebookLooking to list your PhD opportunities? Log in here.
We have 36 Pure Mathematics PhD Projects, Programmes & Scholarships for Self-funded Students
Pure Mathematics PhD Projects, Programmes & Scholarships for Self-funded Students
We have 36 Pure Mathematics PhD Projects, Programmes & Scholarships for Self-funded Students
Faculty of Science URSA Project: Tropical Quantifier Elimination with Real Implications
This project is one of a number that are in competition for funding from the University of Bath URSA competition, for entry in September 2025. Read more
Partition functions through the lens of topological recursion
The proposed research aims to resolve longstanding conjectures, prove rigorous results, and introduce new structures concerning partition functions that have arisen from mathematical physics. Read more
PhD studentship: Generalisations of Khovanov homology and their applications
Award Summary. 100% fees covered, and a minimum tax-free annual living allowance of £19,237 (2024/25 UKRI rate). Additional project costs will also be provided. Read more
Mathematically modeling systems resilient against unforeseen attacks
This project will propose mathematical decision-support tools to assist an operator in making the UK electrical grid more resilient against unforeseen attacks and develop algorithms that enable us to solve such models both efficiently and quickly. . Read more
Topological and Geometric Properties of Laplace eigenfunctions
Spectral geometry is the area of mathematics where one studies inter-relations between explicit geometric invariants of a Riemannian (or sub-Riemannian) manifold with the spectrum of the Laplace (or Laplace type) operators. Read more
Application of rearrangement optimization theory to optimization or optimal control problems coming from the real world
In this project, we plan to use the mathematical tool "rearrangement optimization theory" to study various optimization or optimal control problems coming from the real world. Read more
Theoretical study of quantum techniques for Reducing communication complexity in distributed systems
This project is part of the EPSRC Centre for Doctoral Training in Quantum Technology Engineering at the University of Southampton (https://qte.ac.uk/). Read more
Mathematics: Fully Funded PhD Scholarship in Toric Geometry and Multivariate Splines
Funding provider: Swansea University Research Excellence Scholarship (SURES). Subject area: Mathematics. Project start date. Read more
PhD Studentship in “Applications of harmonic analysis in probability and equidistribution theory”
Classical Fourier analysis as well as abstract harmonic analysis on groups and manifolds provide powerful tools in a large number of areas including number theory, probability theory, equidistribution theory and optimal transport. Read more
Last chance to apply
Topics in Fractal Geometry (Ref: SCI25-SB)
The goal of this project is to deepen our understanding of invariant sets and measures arising from iterated function systems. This goal can be approached from various perspectives. Read more
Geometry and difference equations in string theory
This project aims to explore the geometric and physical properties of discrete Schrödinger equations, with a particular focus on their connections to Calabi-Yau geometries and the quantum symmetries arising in String Theory and Quantum Field Theory. Read more
Lattice-Based Cryptography
The threat of large-scale, general-purpose quantum computers to existing public-key cryptographic solutions has lead to global efforts to standardise post-quantum cryptography as a replacement. Read more
The semiring of partial transformations: an algebraic and algorithmic approach to modularity
This project will aim to design algorithms to efficiently solve equations in the semiring of partial transformations. This is a theoretical project in an area that combines graph theory, algebra, and algorithms. Read more
Algorithmic aspects of phylogenetic trees and networks
The Project. this is an open call for phd students wishing to work in the area of algorithms, complexity and combinatorics related to phylogenetics. Read more
Graph Colouring
Most optimization problems defined on graphs are computationally hard in general. This holds for the Graph Colouring problem, the problem of assigning a unique colour to each vertex of a graph, in such a way that any two adjacent vertices receive different colours, using the smallest possible number of colours. Read more