Events - January 2021

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Algorithmic Randomness and Complexity (Part II)"

We pick up where we left off in discussing measures of randomness for finite binary strings.

Luke MacLean, Department of Pure Mathematics, University of Waterloo

"Algorithmic Randomness and Complexity"

We begin a new series of talks exploring the concept of what it means for mathematical objects (encoded as binary sequences) to be random. This relates strongly to Computability Theory, and so to make the talks accessible to all who are interested, a brief introduction to Computability will be given.

Jim Bryan, University of British Columbia

"Counting curves on Abelian Varieties and Modular Forms"

Ragini Singhal, Department of Pure Mathematics, University of Waterloo

"New G₂-holonomy cones and exotic nearly Kähler structures on S⁶ and S³ × S³"