Jonathan Noel

Jonathan Noel is an Assistant Professor in the Department of Mathematics and Statistics at the University of Victoria. His research focuses on extremal combinatorics, probabilistic combinatorics, and combinatorial limits, with applications to quasirandomness, Ramsey theory, and graph theory. He holds a DPhil (PhD) from the University of Oxford and teaches courses such as MATH 122 (Logic and Foundations) and MATH 529 (Topics in Discrete Mathematics).

His research interests include extremal set theory, graph colouring, graph homomorphisms, bootstrap percolation, and computational complexity. He explores how local patterns in discrete structures influence global properties, such as the interplay between edge densities and cycle counts in graphs.

Recent work emphasizes quasirandomness through permutation patterns and entropy methods, alongside bootstrap percolation dynamics in hypercubes and cellular automata. His articles often bridge combinatorial limits with analytic approaches, such as the Szemerédi Regularity Lemma.

No awards are listed for Jonathan Noel in the provided text. He advises no formally listed students but contributes to academic supervision through course instruction.