University of Victoria

The question of how species coexist is one of the most fundamental questions in ecology. The standard approach for using models to understand what leads to ecological coexistence can be caricatured as start with a model, specify parameters, and look...

A central tool in additive combinatorics is the polynomial method, a family of powerful techniques for proving results about combinatorial objects by encoding them in algebraic terms. In this talk, we give a brief overview of some iconic modern...

Let $T$ be a tree in which no vertex has degree $2$. A Halin graph is a planar graph obtained by connecting all leaves of $T$ into a cycle in their planar order. The idea of universal originates from a question of John W. Moon (1965). Consider all...

This Alternative Math Education event will present fun methods of teaching math and computer science concepts to children (and adults!) using games and art. Lots of hands-on activities! Including: A Sorting Network An Impossible Balancing Act Bubbles...

Tentative Schedule : Friday, August 14 5:00 pm – BBQ on Campus – Outside DSB - David Strong Building 6:45 pm – 7:00 pm – Brief Outline of the Hackathon (that will take place on Sunday) 7:00 pm – 8:00 pm – Icebreaker – Group problem solving Saturday...

The course content is given below, grouped according to instructor Jody Reimer (Utah) Lecture topics: Uncertainty quantification, microbial resistance and optimal decision-making in a changing world Microbial community resilience: Microbial...

The game of Cops and Robbers is a two-player pursuit–evasion game played on a graph, in which a set of cops attempt to capture a single robber. The players occupy vertices of the graph and take turns moving along edges; capture occurs when a cop and...

In this talk, I will talk about applications of the entropy method and a tool that we call the mixture bound. To demonstrate how the mixture bound can be applied, I will show how one can prove Lovász’s version of the Kruskal–Katona theorem. I will...

Cooperative motion is a random walk process where the jump rate of a particle depends on the likelihood that another independent identical walker is at the same position. It was studied on the line in a paper by Addario-Berry, Cairns, Devroye...

Iteration has revealed mathematical structure for millennia—from ancient Babylonian root-finding techniques to the intricate fractals developed by Fatou and Julia during the First World War. Yet many mysteries remain. One such puzzle centers on...