Réunion d'été SMC 2026

Saint John, 5 - 8 juin 2026

       

Index

Éducation :
Scientifique :
Affiches :

Sessions scientifiques

La liste des sessions d'éducation figure au bas de la page.

Veuillez noter que les heures sont exprimées en heure normale de l'heure normale de l'Est (HNE).

Applied Dynamical Systems and Mathematical Biology
Org: Lin Wang (University of New Brunswick) et Yuan Yuan (Memorial University)
The session is devoted to recent progress in applied dynamical systems involving ordinary, partial, and fractional differential equations, with applications in mathematical biology. The focus will include, but is not limited to, the qualitative behavior of these equations, as well as applied models arising in population dynamics, infectious disease modeling, and ecological systems.
 
Category Theory
Org: Salja Deni, Robert Morisette et Dorette Pronk (Dalhousie University)
The scope of research in category theory has significantly grown over the last decade: there are new branches of categorical research such as infinity categories with their applications in homotopy theory and homotopy type theory, and an increased interest in older branches such as tangent categories and double categories, with exciting new applications in logic, theoretical computer science, and systems theory. In this session we welcome researchers in all areas of category theory and applications of category theory to share their latest results and develop new connections.
 
Combinatorial Design Theory
Org: Masoomeh Akbari (University of Ottawa), Kianoosh Shokri (University of Ottawa) et Brett Stevens (Carleton University)
Combinatorial design theory studies the existence, construction, and structure of arrangements of finite objects, such as subsets, arrays, and graphs, that satisfy prescribed constraints. Leonhard Euler studied pairs of orthogonal Latin squares in the 18th century, with design theory's origins tracing back even earlier to a magic square on a turtle’s back in ancient China around 2200 BC. In the 20th century, connections with statistics, algebra, and finite geometry, together with the development of computational methods, opened new directions in the field. Today, combinatorial design theory is a multidisciplinary area with applications in algorithm design, cryptography, wireless communication, and coding theory, and has seen significant recent growth. The purpose of this session is to showcase recent results on classical designs, cycle systems, graph decompositions, Latin squares, and related topics.
 
Horaire à déterminer
Tim Alderson (University of New Brunswick)
Simon Blackburn (Royal Holloway, University of London)
Amanda Chafee (Carleton University)
Joy Cooper (University of Victoria)
Peter Danziger (Toronto Metropolitan University)
Shonda Dueck (University of Winnipeg)
Aaron Dwyer (Carleton University)
Marie Rose Jerade (University of Ottawa)
Shuxing Li (University of Delaware)
William Martin (Worcester Polytechnic Institute)
Prangya Parida (University of Ottawa)
David Pike (Memorial University)
Shahriyar Pourakbar Saffar (Memorial University)
Doug Stinson (University of Waterloo / Carleton University)
 
Combinatorial Game Theory
Org: Svenja Huntemann (Mount Saint Vincent), Neil McKay (UNB Saint John) et Peter Selinger (Dalhousie University)
Combinatorial game theory is the study of two-player perfect information games such as chess or go. We will be exploring current research directions in combinatorial game theory. Some topics include impartial games, normal play and misère play games, and extensions of this theory to games such as Hex.
 
Geometric Group Theory
Org: Adam Clay (University of Manitoba), Eduardo Martinez Pedroza (Memorial University) et Nicholas Touikan (University of New Brunswick)
The session's ​focus on recent advances in the study of finitely generated groups via highlighting combinatorial, geometric, topological, algorithmic, asymptotic, and probabilistic methods. The session aims to have a large ratio of early-career researchers in the area.
 
Homotopy Theory
Org: Martin Frankland (University of Regina), Cameron Krulewski (Dalhousie University) et Daniel Teixeira (Dalhousie University)
This session will bring together researchers working in homotopy theory and its applications to related fields, such as algebraic topology, geometric topology, algebraic geometry, and mathematical physics. Speakers will make their talks accessible to attendees outside of their own subfields.
 
Problems in Graph Searching
Org: Beth Ann Austin (Memorial University), Iain Beaton (Acadia University) et Danielle Cox (Mount Saint Vincent University)
Many problems in graph searching include searcher(s) trying to capture a mobile evader in a network. There is a rich history of variant problems which explore different actions of searchers and robbers, conditions of capture, speed, or visibility. Recently, there have been more developments in the field of graph searching, especially when it comes to deterministic and probabilistic problems. This session aims to draw on the research of people working on a variety of graph searching problems such as cops and robbers, localization, firefighting, graph burning, and eternal domination.
 
Horaire à déterminer
Beth Ann Austin (Memorial University)
Griffin Bartlett (Memorial University)
Anthony Bonato (Toronto Metropolitan University)
Nancy Clarke (Acadia University)
Alex Clow (Simon Fraser University)
Melissa Huggan (Vancouver Island University)
Pipes Logan (Memorial University)
Meagan Mann (Queen's University)
Trent Marbach (Acadia University)
John Marcoux (Toronto Metropolitan University)
Margaret-Ellen Messinger (Mount Allsion University)
Teddy Mishura (Toronto Metropolitan University)
Joy Morris (University of Lethbridge)
Todd Mullen (University of Prince Edward Island)
Amanda Porter (University of Victoria)
 
Structural and Algorithmic Graph Theory
Org: Ben Cameron (University of Prince Edward Island), Alexander Clow (Simon Fraser University) et Margaret-Ellen Messinger (Mount Allison University)
It is generally believed that for most fundamental problems on graphs and networks, efficient algorithms that apply to all possible inputs cannot exist. One approach to finding efficient algorithms is to study the structure of graphs which are restricted in various ways. This session will focus on graph structure and its application to designing efficient algorithms for important problems including graph colouring, homomorphisms, combinatorial reconfiguration, flows, packings and coverings, and finding Hamiltonian cycles.
 
Horaire à déterminer
Iain Beaton (Acadia University)
Ben Cameron (University of Prince Edward Island)
MacKenzie Carr (Toronto Metropolitan University)
Nancy Clarke (Acadia University)
Alexander Clow (Simon Fraser University)
Julien Codsi (Princeton University)
Peter Collier (Dalhousie University)
Karen Collins (Wesleyan University)
Gena Hahn (Université de Montréal)
Sean Kim (Simon Fraser University)
Taite LaGrange (Waterloo University)
Margaret-Ellen Messinger (Mount Allison University)
Ben Seamone (Dawson College)

Sessions d'éducation

Mathematics for Play, Community, and Connection: A Public Recreational Math Expo
Org: Hope Alderson (University of New Brunswick (Saint John)) et John Grant McLoughlin (University of New Brunswick (Fredericton))
A public Recreational Mathematics Expo is being held alongside the 2026 CMS Summer Meeting in Saint John. The event welcomes families, teachers, students, and community members to engage with mathematics through hands-on activities, puzzles, and games, highlighting mathematics as playful, creative, and accessible. The Expo will foster community engagement and outreach while complementing the research and education sessions of the CMS meeting.

Affiches

Présentations par affiches des étudiants - AARMS-SMC
Org: Sarah et Xinxin (cms)

© Société mathématique du Canada : http://www.smc.math.ca/