Keynote Speakers / Les Conférenciers

Jason Bell - University of Waterloo, Pure Mathematics

Keynote: Integer Factorial Ratios

Abstract: The Prime Number Theorem asserts that the number of prime numbers up to a number x grows at the rate x/log(x) as x gets large.  Before this was proved, Chebyshev used the fact that 30n! n!/((15n)! (10n)! (6n)!) is always an integer to prove that the number of prime numbers up to x is between .92x/log(x) and 1.11x/log(x) for x large enough.  In this talk, we’ll look at Chebyshev’s sequence and other integer factorial ratios, and we’ll look at a remarkable classification due to Bober, which classifies all integer factorial ratios under some natural constraints.

Debbie Leung - Combinatorics and Optimization, University of Waterloo

Keynote: Channel capacities, classical vs quantum 

Abstract: The best rate for a noisy communication channel to transmit data nearly perfectly is called the capacity.  Surprisingly, the capacity for a classical channel to transmit classical data has a simple expression, with consequences such as, there is only one way for a channel to have zero capacity, and there is no capacity gain by coding for two different channels used jointly.  This talk will feature notable differences for the quantum setting when we consider the capacity for a quantum channel to transmit quantum data.  

Florian Girelli - Applied Mathematics, University of Waterloo

Keynote: TBD

Abstract: TBD

Myrto Mavraki - Department of Mathematical and Computational Sciences, University of Toronto (Mississauga)

Keynote: Unlikely intersections from iterations: the riddle of shared preperiodic points

Abstract: From Babylonian root-finding algorithms to Fatou-Julia's WWII-era fractals, iteration has always led to hidden patterns. But when do two different dynamical systems share the same preperiodic points — numbers trapped in finite loops? We’ll explore this question rooted in the number theoretic theme of ‘unlikely intersections.’ 

Craig Kaplan - School of Computer Science, University of Waterloo

Keynote: The Mystery of Aperiodic Tilings

Abstract: Tiling theory, the study of shapes that fill the plane with no gaps and no overlaps, is a source of beautiful and profound mathematical mysteries.  These mysteries arise in part from the ways that the shapes used in the tiling affect the kinds of tilings that can be constructed from those shapes.  In particular, aperiodicity arises when the shapes are flexible enough to permit tilings, but restrictive enough to suppress all periodic repetition in those tilings.  I will introduce the topic of aperiodic tilings, and present a selection of important examples of this phenomenon, culminating in the aperiodic monotiles discovered in 2023.  

Grace Y. Yi - Data Science, University of Western Ontario

Keynote: A Comparative Perspective on Making Sense of Noisy Data from Statistical Science to Machine Learning

Abstract: In the data-driven era, data quality plays a pivotal role in ensuring valid statistical inference and robust machine learning performance. Yet, imperfections such as measurement error in predictors and label noise in supervised learning are pervasive across a wide range of domains, including health sciences, epidemiology, economics, and beyond. These imperfections can obscure true patterns, introduce bias, and compromise the reliability of analyses. Such issues have attracted extensive attention from both the statistical and machine learning communities. In this talk, I will offer a brief comparative review of approaches in statistical science and machine learning, highlighting the importance of addressing data quality issues and developing strategies to mitigate their adverse effects on inference and prediction.