Events - 2020

Jason Lotay, University of Oxford

"Lagrangian mean curvature flow and the Gibbons-Hawking ansatz"

Spiro Karigiannis, Department of Pure Mathematics, University of Waterloo

"Towards higher dimensional Gromov compactness in $G_2$ and $\mathrm{Spin}(7)$ manifolds"

Shubham Dwivedi, Department of Pure Mathematics, University of Waterloo

"Topics in G_2 geometry and geometric flows"

Rahim Moosa, Department of Pure Mathematics, University of Waterloo

"Dynamics on the Berkovich line II"

I will continue to discuss how algebraic dynamics on the affine or projective line extend to the Berkovich  line. My aim is still Theorem 4.7 of Jonsson's notes.

MC 5403

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Kleene's $\mathcal{O}$"

A computable ordinal is one that corresponds to the order type of some computable linear well ordering. It can be shown that these are a subset of the countable ordinals, but there is still an issue on how to name these ordinals. We would like a system of notation that allows us to compare two arbitrary ordinals.

Christopher Hawthorne & Wilson Poulter, Department of Pure Mathematics, University of Waterloo

"NIP XIV"

We continue section 4.2 of Simon's Guide to NIP theories.

MC 5479

Andrew Putman, University of Notre Dame

"The topology of the moduli space of curves"

The moduli space of curves is a remarkable space with connections to algebraic geometry, complex analysis, differential geometry, and low-dimensional topology.  I'll give an elementary introduction to it and discuss some recent work on its topology.

MC 5501

Gavin Ball, Université du Québec à Montréal and Centre de recherches mathématiques

"Closed G2-structures inducing a conformally flat metric"

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Kleene's $\mathcal{O}$"

Kleene's $\mathcal{O}$ is a system for ordinal notation used in computability theory that relates the concepts of constructive and computable ordinals. This notation allows one to unambiguously perform transfinite induction on ordinals by ensuring that there is a unique representation for each ordinal.

We will prove some properties about the notation system and show that there are ordinals which are not computable.

MC 5413

Wilson Poulter, Department of Pure Mathematics, University of Waterloo

"NIP XIII"

We continue section 4.1 of Simon's Guide to NIP theories.

MC 5479

Ilan Hirshberg, Ben Gurion University of the Negev

"Mean dimension and radius of comparison"