Luke MacLean, Department of Pure Mathematics, University of Waterloo
"The Fundamentals of Computability Theory"
Spiro Karigiannis, Department of Pure Mathematics, University of Waterloo
"Towards higher dimensional Gromov compactness in $G_2$ and $\mathrm{Spin}(7)$ manifolds"
Shima Bab Hadiashar, Department of Combinatorics & Optimization, University of Waterloo
"Quantum PAC-Learning"
Jason Lotay, University of Oxford
"Lagrangian mean curvature flow and the Gibbons-Hawking ansatz"
Sam Kim, Department of Pure Mathematics, University of Waterloo
"Operator Systems, Crossed Products, and Correlation Sets"
Ertan Elma, Department of Pure Mathematics, University of Waterloo
"Some Problems in Multiplicative and Additive Number Theory"
Online
Ehsaan Hossain, Department of Pure Mathematics, University of Waterloo
"Recurrence in Algebraic Dynamics"
Let $\varphi:X\dashrightarrow X$ is a rational mapping of an algebraic variety $X$ defined over $\C$. The orbit of a point $x\in X$ is the sequence $\{x,\varphi(x),\varphi^2(x),\ldots\}$. Our basic question is: how often does this orbit intersect a given closed set $C$? Thus we are interested in the return set
\[ E := \{n\geq 0 : \varphi^n(x)\in C\}. \]
Adam Humeniuk, Department of Pure Mathematics, University of Waterloo
"Generatingfunctionology: basics and approximation"
A generating function is a device for studying a sequence by trapping it in the coefficients of a power series. I'll give a brief crash course on "generatingfunctionology", and show you how to write down the generating function of Fibonacci numbers. This gives, for instance, an exact formula for the nth Fibonacci number. We don’t usually care whether the series converges, and work in the setting of “formal” power series.
Zsolt Tanko, Department of Pure Mathematics, University of Waterloo
"Coefficient spaces arising from locally compact groups"
Chao Li, Princeton University
"Geometric comparison theorems for scalar curvature lower bounds"