2023 Science Atlantic MSCS Conference
2023-10-13 - 2023-10-15 | University of Prince Edward Island, Charlottetown, Prince Edward Island, Canada
The Science Atlantic Mathematics, Statistics, and Computer Science Conference is an annual regional event. It provides a platform for undergraduate students in Mathematics, Statistics and Computer Science at Atlantic Canadian universities to disseminate their research projects, participate in contests, and network with other students in the region. It also serves as a networking event for faculty members of Atlantic Canadian universities. In 2023, University of Prince Edward Island will host the conference in Charlottetown, PEI. The dates of the conference is October 13- 15, 2023. Some of the major programs are as follows: Field Lecture, Blundon Lecture, Sedgewick Lecture, Contributed Student’s talks, Mathematics Competition, CS Programming Competition, AARMS Session, Science Atlantic joint Math/CS meeting, Science Atlantic Math and Stats. meeting, Science Atlantic CS meeting, Graduate Student’s Session etc.

Women in Commutative Algebra II
2023-10-16 - 2023-10-20 | Trento, Trento, Italy
The purpose of this event is to establish and enhance research networks among women and female identifying mathematicians who work in the areas of mathematics related to commutative algebra. It will be the second of its kind. The first one (Banff 2019) was an amazing success, with many of the groups still working together. It has led to a strong network that besides research, provides visibility for women and many opportunities for professional development. It has also served as an example for younger women. We are hoping that WICA II, with its European location, will be more accessible to a larger geographic area.
We need general funds, as most of the sources we apply to are targetted to special regions. Any support from AARMS will be appreciated. If we do not raise enough funds, the event will go ahead but we will have to reduce the number of participants.

Atlantic Graph Theory Seminar
2023-10-18 15:30 - 16:30 UTC | Online via Zoom
Two short talks by grad students Alex Clow and William Kellough. ‘Live’ viewing in Chase 227 for those at Dalhousie.
Talk 1:
Alex Clow, Simon Fraser University
Polynomially Bounding the Oriented Chromatic Number in Euler Genus
In this talk we consider the oriented chromatic number of graphs with bounded Euler genus. In particular, we present our proofs that the oriented chromatic number is at most $g^{6400}$ for sufficiently large $g$ and at least $Omega((frac{g^2}{log g})^{1/3})$. This is a major improvement over the previous best upper bound which is exponential in genus. We conclude the talk by discussing directions for future study. Joint work with Peter Bradshaw and Jingwei Xu from the University of Illinois at Urbana Champaign.
Talk 2:
William Kellough, Memorial University
How to Catch a Cheating Robber on Strong Products
Cops and Robbers is a pursuit-evasion game played on the vertices of a graph. One player controls a set of cops and the other player controls a robber. The cops win if a cop can move to the vertex occupied by the robber in finitely many turns, otherwise the robber wins. In this talk, we consider a variation of Cops and Robbers where both players move simultaneously and the robber “cheats” by knowing how the cops will move each round. We will give bounds on the minimum number of cops needed to win this game when played on the strong product of two graphs. This is joint work with Nancy Clarke and Danny Dyer.
Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Atlantic Graph Theory Seminar
2023-11-01 15:30 - 16:30 | Online via Zoom
Detecting (Di)Graphical Regular Representations
Speaker: Joy Morris, U. Lethbridge
Abstract: Graphical and Digraphical Regular Representations (GRRs and DRRs) are a concrete way to visualise the regular action of a group, using (di)graphs. More precisely, a GRR or DRR on the group $G$ is a (di)graph whose automorphism group is isomorphic to the regular action of $G$ on itself by right-multiplication.

For a (di)graph to be a DRR or GRR on $G$, it must be a Cayley (di)graph on $G$. Whenever the group $G$ admits an automorphism that fixes the connection set of the Cayley (di)graph setwise, this induces a nontrivial graph automorphism that fixes the identity vertex, which means that the (di)graph is not a DRR or GRR. Checking whether or not there is any group automorphism that fixes a particular connection set can be done very quickly and easily compared with checking whether or not any nontrivial graph automorphism fixes some vertex, so it would be nice to know if there are circumstances under which the simpler test is enough to guarantee whether or not the Cayley graph is a GRR or DRR. I will present a number of results on this question.

Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Atlantic Graph Theory Seminar
2023-11-22 15:30 - 16:30 | Online via Zoom
Speaker: Santiago Guzman-Pro, TU Dresden
Title: Forbidden Tournaments and the Orientation (Completion) Problem

Abstract: For a fixed finite set of oriented graphs F, the F-free orientation problem asks
whether a given finite undirected graph G has an F-free orientation, i.e., whether the edges
of G can be oriented so that the resulting oriented graph does not contain any oriented
graph from F as an oriented (induced) subgraph. It was first noted by Bang-Jensen, Huang,
and Prisner that when F is a set of oriented paths on 3 vertices, this problem easily reduces
to 2-SAT, and thus is solvable in polynomial-time. This was later extended to sets of oriented
graphs on 3 vertices (G.P. and Hernández-Cruz 2017). Towards a complete understanding
of the complexity of the F-free orientation problem, we consider the case when F is a set of
finite tournaments. We prove that for every such F, this problem is in P or NP-complete.Specifically, we show that either the F-free orientation problem can be reduced (in polynomial-
time) to a system of Boolean linear equations, or the F-free orientation problem is NP-complete.
This dichotomy result is accompanied by a classification statement which, given a set of
tournaments F, allows us to decide whether the F-free orientation problem is in P or
NP-complete. We reduce this classification task to a complete complexity classification of the
orientation completion problem for F, which is the variant of the problem above where the input
is a partially oriented graph instead of an undirected graph, introduced by Bang-Jensen, Huang,
and Zhu (2017). Our proof uses results from the theory of constraint satisfaction, and a result
of Agarwal and Kompatscher (2018) about infinite permutation groups and transformation monoids.

This is joint work with Manuel Bodirsky.

University of New Brunswick Data Challenge 2023
2023-11-24 | University of New Brunswick (Fredericton Campus), Fredericton, New Brunswick, Canada
The UNB Data Challenge 2023 will bring together two competitive tracks, Data Visualization (8th Annual), and Data Analytics (4th Annual) on Nov. 24, 2023, in a virtual format! Take up the challenge and demonstrate the power of data.
Participants and teams will have the chance to showcase their ability to tell a story driven by data in unique competitive formats. Teams can participate in both tracks. It is an ideal setting for citizens to get engaged, meet leaders in academia, government, and private organizations, and explore the world of data science.

Atlantic Graph Theory Seminar
2023-11-29 15:30 - 16:30 | Online via Zoom
Speaker: Jordan Barrett, Toronto Metropolitan University
Title: Graph burning, the burning number conjecture, and burning density
Abstract: Graph burning is a discrete time process on a graph that acts as a simple model for the spread of social contagion in a network. Graph burning was introduced by Bonato, Janssen and Roshanbin in 2014, and with this introduction came the now famous “burning number conjecture”. In the first half of my talk, I will introduce graph burning and give a brief overview of the progress made towards the burning number conjecture. Then, for the remainder of the talk, I will introduce a variation of graph burning in which the graph grows over time. In this variation, if the graph grows fast enough then we may never be able to burn all of the vertices at any given time. We are instead interested in the “burning density”, i.e., the limiting ratio of burning vertices to all vertices. The talk will conclude with some new results by Gunderson, Nir, Pralat, and myself, classifying the obtainable burning densities on growing grid-graphs.
Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Session on Combinatorial Design Theory at the 2023 Winter Meeting of the Canadian Mathematical Society
2023-12-01 - 2023-12-04 | Montreal, Montreal, Quebec, Canada
Combinatorial design theory has a history dating back to the 18th century when Leonhard Euler pondered the existence of orthogonal pairs of Latin squares. This session will showcase recent results in topics such as classical designs, cycle systems, graph decompositions, Latin squares and other aspects of design theory.

Advances in Statistical Modeling of Fisheries Data - Seminar
2023-12-01 14:00 - 15:00 | online via webex
A Spatiotemporal Model of Condition to Derive a Novel Starvation Mortality Index That Improves a State-space Stock Assessment Model for Atlantic Cod on the Southern Grand Bank of Newfoundland
Madhura Weerasekera, Centre for Fisheries Ecosystems Research (CFER), Fisheries and Marine Institute of Memorial University of Newfoundland
The Atlantic cod stock on the Southern Grand Bank (SGB) of Newfoundland collapsed in the early 1990’s coincident with the collapse of cod stocks across Canadian waters. Consequently, a fishing moratorium has been in place for this stock since 1994. SGB cod is characterized by low productivity and poor fish condition relative to some other cod stocks. The primary focus of my research is to investigate how fish condition influences the natural mortality rate (M) and the prospects for rebuilding for the SGB cod stock. I developed a novel spatiotemporal condition model using DFO spring and fall survey measurements of fish length and weight. A stochastic approach was used to model weight as a function of length (i.e., condition) and other effects for survey strata, year, month, length, and their interactions. Model selection criteria were used to determine the best model. The model formulation that included only the interaction effects was the best fitting. This model was used to derive a novel length-based starvation mortality rate (MK) index. Results indicated that the MK index is higher in the spring than in the fall. It is also higher for cod between 55-80 cm in length and for cod larger than 120 cm. Additionally, the MK index was found to be higher during 1991-1993 when the stock experienced a substantial decline, and it was also high in 2016. The MK index was then converted into an age-based index and incorporated into an age-based state-space stock assessment model (SSAM) as a component of M. The inclusion of MK in the SSAM led to a significant decrease (62%) in the size of the cohort process errors (i.e., their standard deviation). This reduction suggests that the MK significantly improved the model of stock productivity. Therefore, I conclude that MK explains a substantial portion of the variation in M, and that starvation mortality is an important component of the productivity of SGB cod.
Meeting Link:

Join from the meeting link

https://mun.webex.com/mun/j.php?MTID=mc6c30b8769a0732739e102e6f596a125

Join by meeting number

Meeting number (access code): 2772 604 8669

Meeting password: [REDACTED]

Atlantic Graph Theory Seminar
2024-01-17 15:30 - 16:30 | Online via Zoom
Speaker: Leslie Hogben, Iowa State University
Title: Forts, (fractional) zero forcing, and Cartesian products of graphs

Abstract: Zero forcing is an iterative process that repeatedly applies a rule to change the color of vertices of a graph $G$ from white to blue. The zero forcing number is the minimum number of initially blue vertices that are needed to color all vertices blue through this process. Standard zero forcing was introduced about fifteen years ago in the control of quantum systems and as an upper bound for maximum multiplicity of an eigenvalue (or maximum nullity) among matrices having off-diagonal nonzero pattern described by the edges of the graph $G$, and rediscovered later both as part of power domination and as fast-mixed graph searching.

Whether a set is a zero forcing set can be tested using a certain type of set called a fort, which obstructs zero forcing. The maximum number of disjoint forts (fort number) provides another lower bound for the zero forcing number; results about fort number will be discussed. Forts can be used in integer programs to determine the zero forcing number and fort number. The relaxation of these integer programs leads to dual linear programs that define the fractional zero forcing number, or equivalently, the fractional fort number, and results about these parameters will be discussed.

There is a well-known upper bound for the zero forcing number of a Cartesian product in terms of the zero forcing numbers and orders of the constituent graphs. The question of a lower bound for the zero forcing number of a Cartesian product has recently been studied. It is easy to see that there is a Vizing-like lower bound when the constituent graphs of the Cartesian product both have maximum nullity equal to zero forcing number. Fractional zero forcing and fort number provide additional lower bounds on the the zero forcing number of a Cartesian product in terms of parameters of the constituent graphs.

______________________________________________________________________________
Jeannette Janssen is inviting you to a scheduled Zoom meeting.

Topic: Atlantic Graph Theory Seminar
Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Atlantic Graph Theory Seminar
2024-01-24 15:30 - 16:30 | Online via Zoom
Speaker: Torsten Mütze, Un. Warwick
Title: Kneser graphs are Hamiltonian

Abstract: For integers k>=1 and n>=2k+1, the Kneser graph K(n,k) has as vertices all k-element subsets of an n-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle, with one notable exception, namely the Petersen graph K(5,2). This problem received considerable attention in the literature, including a recent solution for the sparsest case n=2k+1. The main contribution of our work is to prove the conjecture in full generality. We also extend this Hamiltonicity result to all connected generalized Johnson graphs (except the Petersen graph). The generalized Johnson graph J(n,k,s) has as vertices all k-element subsets of an n-element ground set, and an edge between any two sets whose intersection has size exactly s. Clearly, we have K(n,k)=J(n,k,0), i.e., generalized Johnson graphs include Kneser graphs as a special case. Our results imply that all known families of vertex-transitive graphs defined by intersecting set systems have a Hamilton cycle, which settles an interesting special case of Lovász’ conjecture on Hamilton cycles in vertex-transitive graphs from 1970. Our main technical innovation is to study cycles in Kneser graphs by a kinetic system of multiple gliders that move at different speeds and that interact over time, reminiscent of the gliders in Conway’s Game of Life, and to analyze this system combinatorially and via linear algebra.

This is joint work with my students Arturo Merino (TU Berlin) and Namrata (Warwick).

———————————————————
Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Combinatorial Algebra Meets Algebraic Combinatorics
2024-01-26 - 2024-01-28 | Montreal, Montreal, Quebec, Canada
Combinatorial Algebra Meets Algebraic Combinatorics (CAAC) is a two-day workshop bringing together researchers working at the intersection of combinatorics and algebra. It examines the role of combinatorial structures, such as permutations, matroids and polytopes, arising from problems in Schubert calculus, commutative algebra, and other branches of algebra, representation theory and geometry.

Atlantic Graph Theory Seminar
2024-01-31 15:30 - 16:30 | Online via Zoom
Speaker: Thiago de Holleben, Dalhousie University
Title: Homological invariants of graphs with no induced cycles of length divisible by 3

Abstract: If G is a graph with large chromatic number, what can we say about its induced subgraphs? In 2014, Bonamy et al. showed that if a graph has no induced cycles of length divisible by three, then its chromatic number is bounded. Such graphs are called ternary.
In an attempt to better understand the structure of the induced subgraphs of a graph with bounded chromatic number, Kalai and Meshulam posed questions relating topological invariants of the independence complex, and the chromatic number of a graph. Since then, there have been several results bounding chromatic numbers of graphs using topology. In 2022, Jinha Kim showed a conjecture of Engström stating the exact topological structure of the independence complex of a ternary graph. In this talk, we describe a graph theoretic way of computing this structure. As an application, we show that -1 is a root of the independence polynomial of a forest F if and only if the induced matching number of F is not equal to the domination number of F.

Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Atlantic Graph Theory Seminar
2024-02-06 15:30 - 16:30 | Online via Zoom
Zoom link below. Live viewing for local participants in Chase 227 (tea-drinkers are encouraged to bring their own mug).

Speaker: Evelyn Smith-Roberge, Georgia Tech
Title:Correspondence Packings of Planar Graphs

Abstract: Suppose a graph G has list chromatic number k. It is easy to see that if L is a (k+1)-list assignment for G, then G admits two L-colourings f and g where f(v) =/= g(v) for every vertex v in the graph. But what if we want still more disjoint L-colourings without making our lists too big? In this talk, I will discuss recent progress towards determining the list packing number of various classes of planar graphs: that is, the smallest number k such that if L is a k-list assignment for an arbitrary graph G in the class under study, then L can be decomposed into k disjoint L-colourings. All results I will discuss also hold in the correspondence colouring framework. Joint work with Daniel Cranston.

Join ZOOM Meeting:
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Atlantic Graph Theory Seminar
2024-02-14 15:30 - 16:30 | Online via Zoom
Speaker: Andrew Beveridge, Macalester College
Title: Approval Ballot Triangles
Time: Wednesday, February 14, 3.30pm Atlantic time
Live viewing for local participants in Chase 227, Dalhousie University

Bertrand’s Ballot Problem enumerates the number of ways to count ballots so that candidate 1 never trails candidate 2. We generalize this problem by considering an approval ballot election between $n$ candidates. In an approval ballot election, each voter endorses a subset of candidates, rather than voting for just one person. The general approval ballot problem becomes: how many ways can the ballots be counted so that candidate $k$ never trails candidate $k+1$? This formulation yields a family of binary triangular arrays, called approval ballot triangles (ABTs), that are in bijection with totally symmetric self-complementary plane partitions. We show that ABTs unify three different TSSCPP families of triangular arrays. We then further the connection between TSSCPPs and ballot problems by giving a decomposition of a strict-sense ballot into a list of sequentially compatible ABTs

Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Atlantic Graph Theory Seminar
2024-02-21 15:30 - 16:30 | Online via Zoom
Speaker: Ada Chan, York University
Title: Polygamy in state transferAbstract:Let $X$ be a graph and $H$ be a Hermitian matrix associated with $X$. The continuous-time quantum walk with Hamiltonian $H$ isdefined by the time-dependent unitary matrixbegin{equation*}U(t)=e^{i t H}.end{equation*}Perfect state transfer occurs from vertex $a$ to vertex $b$ at time $tau$ is $vert U(tau)_{b,a}vert = 1$. This phenomenon is relevant for information transmission in a quantum spin network. For real and symmetric Hamiltonians, it is known that perfect state transfer can occur from a vertex to at most one other vertex,mand that graphs with perfect state transfer are rare. A relaxation, called pretty good state transfer, occurs from $a$ to $b$ if $vert U(tau)_{b,a}vert$ gets arbitrarily close one. Pal and Bhattacharjya discover a graph with four vertices admitting pairwise pretty good state transfer. In this talk, we present a family of graphs that admit pairwise pretty good state transfer in an arbitrarily large set of vertices. We compare this polygamous behaviour to walks with Hamiltonians that contain non-real entries.

Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

AARMS Seminar: EDI in STEM with Dr. Lisa Willis
2024-02-22 14:00 - 17:00
While EDI has become an often referred to issue in academia and society, it remains a challenging topic to discuss, especially for people in STEM fields. Fear of making a mistake or not knowing what to say results in people disengaging from the conversation. Additionally, the multitude of initiatives and obligations in the EDI space, few of which seem to be making a real difference, is leading to EDI fatigue. In this talk, we will discuss how we as imperfect people can create meaningful sustainable change for ourselves and for the people around us.
Dr. Willis received her B.Sc. in Biochemistry from the University of Victoria and Ph.D. in Molecular and Cellular Biology in the lab of Dr. Chris Whitfield at the University of Guelph. She did her postdoctoral fellowship with Dr. Mark Nitz in the Department of Chemistry at the University of Toronto, where she received the prestigious Banting Postdoctoral Fellowship. In 2019, she started as an Assistant Professor in the Department of Biological Sciences at the University of Alberta, where she is also an Adjunct Professor in the Department of Medical Microbiology and Immunology. She is also the founder of InclusiveSTEM, a literature-based and data-driven framework for improving the participation and lived experiences of people from marginalized groups in STEM.

Join Zoom Meeting
https://us02web.zoom.us/j/83234913058?pwd=[REDACTED]

Meeting ID: 832 3491 3058
Passcode: [REDACTED]

Girls STEM Up
2024-02-24 | Delta Hotels by Mariott Fredericton, 225 Woodstock Rd, Fredericton, New Brunswick, Canada
Established in 2019, Girls STEM Up (GSU) has grown into a vibrant community of over members advocating for diversity, inclusion, and equity in STEM. Focused on changing perceptions, GSU hosts an annual conference spotlighting women’s accomplishments in STEM. The event serves as a transformative platform for networking and knowledge exchange, fueling the passion of young women pursuing STEM careers. The upcoming GSU: Bridging the Gap conference in February 2024 promises to be a pivotal experience. Beyond the conference, GSU remains committed to year-round engagement in the STEM community, leaving a meaningful imprint on aspiring girls in STEM through outreach and social media campaigns. With six successful conferences hosting 200+ delegates and 20 speakers, GSU continues to illuminate multiple paths to success in STEM, inviting all to join their inspiring journey.

Atlantic Graph Theory Seminar
2024-02-28 15:30 - 16:30 | Online via Zoom
Pursuit-evasion on Graphs
Trent Marbach, Toronto Metropolitan University
The study of pursuit-evasion on graphs looks at games played between two adversaries, with one player tasked with alluding capture from the other on the graph. We will describe these types of games in general, although we will take a particular focus on two games: the Cops and Robber game, and the Localization game. A famous open conjecture for the Cops and Robber game has spurred recent work in the area, and we show how this work connects to various graph theory topics, including isoperimetry, network search, and width parameters. We will also provide some new applications that have resulted from this work.
Live viewing at Dalhousie in Chase 227 (bring your own mug for tea).
——————————
Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

2024 Integration Competition
2024-02-29 | Saint Francis Xavier University, 4130 University Avenue, Antigonish, Nova Scotia, B2G 2W5, Canada
The Integration Competition (held 4 times in the past at this university, funded by AARMS), is a head-to-head competition, in which all first-year calculus students are eligible to compete. Integrals of increasing difficulty are projected, and two students work head to head, to solve it first. The winner moves on, and the other student is eliminated. This process moves through successive rounds until only 2 students are left, solving a challenging problem in integration. This generates excitement about mathematics among first year students, aids in recruitment of students to the mathematics major program, and provides motivation for students to engage more deeply with the curriculum in first-year calculus. This event will also serve as an outreach opportunity to connect first-year students with upper-year students, and to discuss opportunities available to math students.

Acadia Math Buffet
2024-03-04 | Acadia University, Wolfville, Nova Scotia, Canada
Acadia’s Math Buffets are a chance for students in grades 9- 12 in Hants, Kings and Annapolis counties to explore new and interactive topics in mathematics. In these 2-hour sessions, students will learn about a variety of math topics, such as networks, Google page rank, cryptography, problem solving and how to win at darts.

Atlantic Graph Theory Seminar
2024-03-06 15:30 - 16:30 | Online via Zoom
Induced subgraphs and treewidth
Speaker: Sophie Spirkl, University of Waterloo
Abstract: Treewidth is a measure of the complexity of a graph and has both structural and algorithmic consequences. While results of Robertson and Seymour characterize which minors appear in graphs of large treewidth, the same question is still open for induced subgraphs. I will present some recent results towards an answer to this question, in particular, about when excluding a finite set of induced subgraphs leads to the answer being “what we expect”. Joint work with Bogdan Alecu, Maria Chudnovsky, and Sepehr Hajebi.

Join Zoom Meeting
https://us02web.zoom.us/j/86415230827?pwd=[REDACTED]

Meeting ID: 864 1523 0827
Passcode: [REDACTED]

Live viewing with refreshments in Chase 227, Dalhousie University (bring your own mug for tea.)

Integration Tournament for UPEI students
2024-03-14 | University of Prince Edward Island, Charlottetown, Prince Edward Island, Canada
Integration Tournament and Pi day event for UPEI Undergraduate Students.

39th Annual New Brunswick Mathematics Competition
2024-05-10 | 5 Locations in New Brunswick, New Brunswick
The provincial New Brunswick Math Competition is a bilingual math competition that takes place in May each year. Students in grades 7-9 from across the province (approximately 1,100 students) attend one of five university locations to simultaneously write the one-hour math competition. There are three competition papers according to grade; each available in both English and French. Following the competition in the morning, students attend enrichment activities held at the universities; awards are distributed at all locations late afternoon. The campuses include UNB Fredericton and Saint John, and the University de Moncton in Moncton, Edmundston, and Shippagan.

CMS-UPEI-AARMS Regional Math Camp
2024-05-10 - 2024-05-12 | University of Prince Edward Island, Charlottetown, Prince Edward Island, Canada
The School of Mathematical and Computational Science (SMCS) is once again organizing the UPEI-CMS-AARMS Regional Math Camp, to be held at UPEI between May 10 – May 12, 2024. We anticipate hosting some of the most talented grade 10 and grade 11 math students from across the Island. This year, we expect to invite 20-25 students. We offer students an opportunity to participate in challenging, intellectual activities with their peers, guided by the UPEI SMCS faculty members. The students will arrive on the UPEI campus by 9:00 am on Friday (May 10), spend 2 nights in residence, and depart at noon on Sunday (May 12). With the help of several volunteer undergraduate math majors, faculty members will conduct several educational, problem-solving and career sessions during the daytime, and recreational sessions during the evenings. The students will be chaperoned at all times
throughout the weekend.

16th East Coast Combinatorics Conference
2024-05-13 - 2024-05-14 | Memorial University (Grenfell Campus), Cornerbrook, Newfoundland and Labrador, Canada
The East Coast Combinatorics Conference is a 2-day annual event that brings together researchers in graph theory, design theory, and other areas of combinatorics. There will be two plenary speakers, and a number of contributed talks, in addition to opportunities for collaboration. The event brings together established researchers and those in the early stages of their academic careers and provides opportunities for subsequent collaborative research projects. We encourage participation by students since they greatly benefit from the opportunity to meet and interact with their peers across the region, as well as to hear about the many and varied research interests of faculty. This year’s event will take place at Grenfell Campus, Memorial University, located in Corner Brook on the scenic west coast of Newfoundland.

Atlantic Topological Quantum Field Theory Spring School 2024
2024-05-20 - 2024-05-24 | Memorial University (St. John’s Campus), St. John's, Newfoundland and Labrador, Canada
Topological Quantum Field Theory lives at the intersection of category theory, algebraic topology, representation theory, and theoretical physics. Physically, TQFTs describe and control the symmetries of quantum systems, including quantum symmetries, anomalous symmetries, and higher-form symmetries. Mathematically, TQFTs provide a dictionary between manifold topology and structures in representation theory, and as such allow computations and results to move between these separate fields. This school, aimed at early- to mid-career graduate students, will consist of three 5-hour minicourses related to TQFTs, plus problem sessions and discussion time. Students are expected to be familiar with the basic language of category theory, but are not expected to have any specialized knowledge in the field.

Blundon Seminar Math Camp
2024-05-23 | Memorial University (St. John’s Campus), St. John's, Newfoundland and Labrador, Canada
The Blundon Seminar is an annual math camp for senior high school students from Newfoundland who are interested in mathematics and demonstrate consistently good performance in mathematics competitions. Participation in the math camp is by invitation
only based on the results of preceding Blundon, COMC, Euclid, Fermat, and Cayley contests. Usually we invite 35 – 50 students. During the seminar the students attend talks given by mathematics professors on various mathematical topics and applications in science and engineering. There are problem solving sessions and other activities such Mathletics or Papers Chase. The winner of the Blundon Contest is presented with the Blundon Shield, and the winners of other contests are also presented with money and book prizes.

UNB CMS Math Camp
2024-05-24 - 2024-05-26 | University of New Brunswick (Fredericton Campus), Fredericton, New Brunswick, Canada
With support from the Canadian Mathematical Society and the Atlantic Association for Research in the Mathematical Sciences, the Department of Mathematics and Statistics at the University of New Brunswick (Fredericton) hosts a three-day, two-night Math Camp. The camp gives a select number of Grade 10 students who are keenly interested in mathematics the opportunity to come stay on the Fredericton Campus, meet fellow students from across the province who share a love of mathematics, and enjoy solving challenging problems together, hearing talks from guest speakers, and playing “basketball math”, among other fun activities.

5th Annual Calculus Instruction in Atlantic Canada Conference
2024-05-24 | Mount Saint Vincent University, 166 Bedford Hwy, Halifax, Nova Scotia, B3M 2J6
The purpose of this workshop is to bring together high school and university instructors from across the Atlantic region to discuss evidence-based pedagogy and innovative instructional methodologies used in introductory calculus courses. From these discussions, we aim to better understand the needs of students in our region, and develop course structures and resources which address these needs in our universities and high schools. This year the focus topic is “Expressing Mathematics in a Meaningful Way”. Students often have difficulty communicating their mathematical ideas. We will explore common errors that students make, ways to improve communication skills and increase comfort and confidence in using math terminology and notation, and ways in which errors can inform our teaching. The one day event will consist of a plenary talk and panel in the morning, with discussion. Lunch will be together, then breakout groups to discuss specific topics.
