BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20240206T153000
DTEND;TZID=UTC:20240206T163000
DTSTAMP:20260612T023204
CREATED:20240205T201726Z
LAST-MODIFIED:20240205T201815Z
UID:7536-1707233400-1707237000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Zoom link below. Live viewing for local participants in Chase 227 (tea-drinkers are encouraged to bring their own mug).\n \nSpeaker: Evelyn Smith-Roberge\, Georgia Tech\nTitle:Correspondence Packings of Planar Graphs\n \nAbstract: 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.\n \nJoin ZOOM Meeting:\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-10/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240214T153000
DTEND;TZID=UTC:20240214T163000
DTSTAMP:20260612T023204
CREATED:20240211T201100Z
LAST-MODIFIED:20240211T201216Z
UID:7549-1707924600-1707928200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Andrew Beveridge\, Macalester College\nTitle: Approval Ballot Triangles\nTime: Wednesday\, February 14\, 3.30pm Atlantic time\nLive viewing for local participants in Chase 227\, Dalhousie University\n \nBertrand’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\n \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n \nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-11/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240221T153000
DTEND;TZID=UTC:20240221T163000
DTSTAMP:20260612T023204
CREATED:20240219T131416Z
LAST-MODIFIED:20240219T131514Z
UID:7556-1708529400-1708533000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Ada Chan\, York University\nTitle: 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 matrix\begin{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.\n\n\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-12/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240222T140000
DTEND;TZID=UTC:20240222T170000
DTSTAMP:20260612T023204
CREATED:20240208T120612Z
LAST-MODIFIED:20240208T120612Z
UID:7546-1708610400-1708621200@aarms.math.ca
SUMMARY:AARMS Seminar: EDI in STEM with Dr. Lisa Willis
DESCRIPTION: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. \nDr. 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. \n  \nJoin Zoom Meeting \nhttps://us02web.zoom.us/j/83234913058?pwd=SFRHcS9SUGpXT09ueHUzY0h6SFpzdz09 \n  \nMeeting ID: 832 3491 3058 \nPasscode: 721065
URL:https://aarms.math.ca/event/aarms-seminar-edi-in-stem-with-dr-lisa-willis/
CATEGORIES:AARMS outreach events
ORGANIZER;CN="David Langstroth":MAILTO:dll@cs.dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240224
DTEND;VALUE=DATE:20240225
DTSTAMP:20260612T023204
CREATED:20240202T124739Z
LAST-MODIFIED:20240202T124739Z
UID:7500-1708732800-1708819199@aarms.math.ca
SUMMARY:Girls STEM Up
DESCRIPTION: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.
URL:https://aarms.math.ca/event/girls-stem-up-2/
LOCATION:Delta Hotels by Mariott Fredericton\, 225 Woodstock Rd\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Subeksha Adhikari":MAILTO:adhikari.subeksha@gmail.com
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240228T153000
DTEND;TZID=UTC:20240228T163000
DTSTAMP:20260612T023204
CREATED:20240228T114600Z
LAST-MODIFIED:20240228T114626Z
UID:7574-1709134200-1709137800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Pursuit-evasion on Graphs\nTrent Marbach\, Toronto Metropolitan University \nThe 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. \nLive viewing at Dalhousie in Chase 227 (bring your own mug for tea). \n——————————\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-13/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240229
DTEND;VALUE=DATE:20240301
DTSTAMP:20260612T023204
CREATED:20240202T215603Z
LAST-MODIFIED:20240202T215603Z
UID:7527-1709164800-1709251199@aarms.math.ca
SUMMARY:2024 Integration Competition
DESCRIPTION: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.
URL:https://aarms.math.ca/event/2024-integration-competition/
LOCATION:Saint Francis Xavier University\, 4130 University Avenue\, Antigonish\, Nova Scotia\, B2G 2W5\, Canada
CATEGORIES:AARMS outreach events
ORGANIZER;CN="Ryan Lukeman":MAILTO:rlukeman@stfx.ca
END:VEVENT
END:VCALENDAR