Events
Calendar of Events
|
Sunday
|
Monday
|
Tuesday
|
Wednesday
|
Thursday
|
Friday
|
Saturday
|
|---|---|---|---|---|---|---|
1 event,The Combinatorial Algebra meets Algebraic Combinatorics (CAAC) workshop is an annual meeting taking place in Canada since 2004, with a focus on the continuously evolving interactions between combinatorial algebra and algebraic combinatorics. These meetings provide a strong connection between the |
0 events,
|
0 events,
|
1 event,
-
Switching m-edge coloured graphs Speaker: Gary MacGillivray, University of Victoria Abstract: An m-edge-coloured graph consists of a set of vertices, any two of which are either joined by an edge of one of m colours or not joined at all. |
0 events,
|
1 event,
-
Abstract: A marine fishery is an important sector in many countries as it contributes towards the nutritional requirements of people and provides income and employment to the associated population. Compared to other natural resources fish being a living resource has |
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Kemeny's constant for Markov chains and random walks on graphs Speaker: Jane Breen, Ontario Tech University Kemeny's constant is an interesting and useful quantifier of how well-connected the states of a Markov chain are. Though it was first introduced in |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Time: 3:30 pm, Atlantic time, (4:00 pm NST) Wednesday, Feb. 12 Speaker: Robert Bailey, Memorial University Title: Computer constructions of distance-regular graphs with primitive automorphism groups Abstract: A graph is distance-regular if, for each vertex $v$ and each vertex $w$ |
0 events,
|
0 events,
|
1 event,Girls STEM Up is collectively 28 women students based in Fredericton, NB, who are passionate about bridging the gap of gender inequity in STEM fields, focusing on intersectionality. Founded in 2019, with the goal of sparking necessary discussions and changing |
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
2 events,The Integration Competition is a fun, head-to-head competition among first-year calculus students to solve integrals, with the winners of each matchup progressing to further rounds until a winner emerges. Participants challenge themselves to solve integral problems on-the-spot, and in addition
-
Speaker: Karen Meagher, University of Regina Title: Derangement graphs and the intersection density of permutation groups Abstract: Two permutations are intersecting if they both map some $i$ to the same point, equivalently, permutations $\sigma$ and $\pi$ are intersecting if and only if |
0 events,
|
0 events,
|
0 events,
|